๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A 2-approximation algorithm for genome rearrangements by reversals and transpositions

โœ Scribed by Qian-Ping Gu; Shietung Peng; Hal Sudborough

Book ID
104326504
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
885 KB
Volume
210
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Sorting Strings by Reversals and by Tran
Sorting Strings by Reversals and by Transpositions
โœ Christie, David A.; Irving, Robert W. ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 169 KB
A Static 2-Approximation Algorithm for V
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
โœ Monika Rauch Henzinger ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 329 KB

This paper presents insertions-only algorithms for maintaining the exact andror approximate size of the minimum edge cut and the minimum vertex cut of a graph. ลฝ . The algorithms output the approximate or exact size k in time O 1 and a cut of size k in time linear in its size. For the minimum edge