Approximating reversal distance for strings with bounded number of duplicates

Authors:
Petr Kolman;Tomasz Waleń
Affiliations:
Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic;Faculty of Mathematics, Informatics and Mechanics, Warsaw University, Banacha z, 02-097, Warsaw, Poland
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 13
Cited 3

Sorting by reversals is difficult

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

Journal of the ACM (JACM)
The string edit distance matching problem with moves

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sorting Strings by Reversals and by Transpositions

SIAM Journal on Discrete Mathematics
Reconstructing an ancestral genome using minimum segments duplications and reversals

Journal of Computer and System Sciences - Computational biology 2002
Edit Distance with Move Operations

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
1.375-Approximation Algorithm for Sorting by Reversals

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A linear-time algorithm for a special case of disjoint set union

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Assignment of Orthologous Genes via Genome Rearrangement

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The greedy algorithm for the minimum common string partition problem

ACM Transactions on Algorithms (TALG)
Approximating reversal distance for strings with bounded number of duplicates

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Minimum common string partition problem: hardness and approximations

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Minimum common string partition revisited

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Exponential and polynomial time algorithms for the minimum common string partition problem

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Minimum common string partition revisited

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.04

Visualization

Abstract

For a string A=a"1...a"n, a reversal@r(i,j), 1==1. The main result of the paper is an O(k^2)-approximation algorithm running in time O(n). For instances with 3