Approximating reversal distance for strings with bounded number of duplicates

Discrete Applied Mathematics

Volumn 155, Issue 3, 2007, Pages 327-336

  Kolman, Petr ^a   Waleń, Tomasz ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Approximation algorithms; Edit distance; Minimum common string partition; Sorting by reversals; String comparison

Indexed keywords

ALGORITHMS; NUMBER THEORY; NUMERICAL METHODS; PROBLEM SOLVING;

APPROXIMATION ALGORITHM; PERMUTATIONS; REVERSAL OPERATION; REVERSED SUBSTRING; SORTING BY REVERSALS (SBR);

APPROXIMATION THEORY;

EID: 33751232626     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.05.011     Document Type: Article

References (17)

1. Bergeron A., Mixtacki J., and Stoye J. Reversal distance without hurdles and fortresses. Proceedings of 15th Annual Combinatorial Pattern Matching Symposium (CPM), Lecture Notes in Computer Science vol. 3109 (2004), Springer, Berlin 388-399
2. Berman P., Hannenhalli S., and Karpinski M. 1.375-approximation algorithm for sorting by reversals. Proceedings of the 10th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science vol. 2461 (2002), Springer, Berlin 200-210
3. Berman P., and Karpinski M. On some tighter inapproximability results. Proceedings of the of 26th International Colloquium on Automata Languages and Programming (ICALP), Lecture Notes in Computer Science vol. 1644 (1999), Springer, Berlin 200-209
4. Caprara A. Sorting by reversals is difficult. Proceedings of the First International Conference on Computational Molecular Biology (1997), ACM Press, New York 75-83
5. Chen X., Zheng J., Fu Z., Nan P., Zhong Y., Lonardi S., and Jiang T. Assignment of orthologous genes via genome rearrangement. IEEE ACM Trans. Comput. Biol. Bioinformatics 2 4 (2005) 302-315
6. Christie D.A., and Irving R.W. Sorting strings by reversals and by transpositions. SIAM J. Discrete Math. 14 2 (2001) 193-206
7. Chrobak M., Kolman P., and Sgall J. The greedy algorithm for the minimum common string partition problem. ACM Trans. on Algorithms, 1 2 (2005) 350-366 Preliminary version in: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2004, pp. 84-95.
8. G. Cormode, S. Muthukrishnan, The string edit distance matching problem with moves, in: Proceedings of the 13th Annual ACM-SIAM Symposium On Discrete Mathematics (SODA), pp. 667-676, 2002
9. El-Mabrouk N. Reconstructing an ancestral genome using minimum segments duplications and reversals. J. Comput. Syst. Sci. 65 3 (2002) 442-464
10. Ergun F., Muthukrishnan S., and Sahinalp S.C. Comparing sequences with segment rearrangements. Proceedings of the 23rd Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Lecture Notes in Computer Science vol. 2914 (2003), Springer, Berlin 183-194
11. M. Farach, Optimal suffix tree construction with large alphabets, in: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), 1997, pp. 137-143.
12. H.N. Gabow, R.E. Tarjan, A linear-time algorithm for a special case of disjoint set union, in: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 246-251.
13. A. Goldstein, P. Kolman, J. Zheng, Minimum common string partition problem: hardness and approximations, Electr. J. Combin. 12 (1) 2005, paper R50, preliminary version in: Proceedings. of the 15 International Symposium on Algorithms and Computation (ISAAC), 2004, pp. 484-495.
14. Hannenhalli S., and Pevzner P.A. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46 1 (1999) 1-27
15. Kolman P. Approximating reversal distance for strings with bounded number of duplicates. Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science vol. 3618 (2005), Springer, Berlin 580-590
16. Sankoff D., and El-Mabrouk N. Genome rearrangement. In: Jiang T., Xu Y., and Zhang M.Q. (Eds). Current Topics in Computational Molecular Biology (2002), The MIT Press, Cambridge 135-155
17. D. Shapira, J.A. Storer, Edit distance with move operations, in: 13th Symposium on Combinatorial Pattern Matching (CPM), Lecture Notes in Computer Science, vol. 2373, Springer, Berlin, 2002, pp. 85-98.