Reversal distance for strings with duplicates: Linear time approximation using hitting set

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4368 LNCS, Issue , 2007, Pages 279-289

  Kolman, Petr ^a   Waleń, Tomasz ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Approximation algorithms; Minimum common string partition; Sorting by reversals; String comparison; Suffix trees

Indexed keywords

COMPUTER SCIENCE; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

MINIMUM COMMON STRING PARTITION; STRING COMPARISON;

APPROXIMATION ALGORITHMS;

EID: 38149094111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11970125_22     Document Type: Conference Paper

References (12)

1. G. Ausiello, A. D'Atri, and M. Protasi. Structure preserving reductions among convex optimization problems. Journal of Computer and System Sciences, 21(1):136-153, 1980.
2. A. Caprara. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM Journal on Discrete Mathematics, 12(1):91-110, 1999.
3. X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi, and T. Jiang. Assignment of orthologous genes via genome rearrangement. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2(4):302-315, 2005.
4. D. A. Christie and R. W. Irving. Sorting strings by reversals and by transpositions. SIAM Journal on Discrete Mathematics, 14(2):193-206, 2001.
5. M. Chrobak, P. Kolman, and J. Sgall. The greedy algorithm for the minimum common string partition problem. ACM Transactions on Algorithms, 1(2):350-366, 2005.
6. G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. In Proceedings of the 13th Annual ACM-SIAM Symposium On Discrete Mathematics (SODA), pages 667-676, 2002.
7. M. Farach. Optimal suffix tree construction with large alphabets. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pages 137-143, 1997.
8. H. N. Gabow and R. E. Tarjan. A linear-lime algorithm for a special case of disjoint set union. Journal of Computer and System Sciences, 30(2):209-221, 1985.
9. A. Goldstein, P. Kolman, and J. Zheng. Minimum Common String Partition Problem: Hardness and Approximations. The Electronic Journal of Combinatorics, 12(1), 2005.
10. S. Hannenhalli and P. A. Pevzner. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM, 46(1):1-27, 1999.
11. P. Kolman. Approximating reversal distance for strings with bounded number of duplicates. In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 3618 of Lecture Notes in Computer Science, pages 580-590, 2005.
12. P. Weiner. Linear pattern matching algorithms. In 14th IEEE Symposium on switching and automata theory, pages 1-11, 1973.