Quick greedy computation for minimum common string partitions

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

Volumn 6661 LNCS, Issue , 2011, Pages 273-284

  Goldstein, Isaac ^a   Lewenstein, Moshe ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION FACTOR; BEST APPROXIMATIONS; BLOCK OPERATIONS; EDIT DISTANCE; EDIT DISTANCE WITH MOVES; GREEDY ALGORITHMS; LINEAR TIME; LOW APPROXIMATION; MINIMUM COMMON STRING PARTITION; MULTISET; NOVEL METHODS; NP COMPLETE; PRACTICAL IMPORTANCE; QUADRATIC TIME; RECURSIVE CONSTRUCTION; REVERSAL DISTANCE; SUB-STRINGS; SUBSTRING; WORST CASE;

ELECTROSTATIC DISCHARGE; PATTERN MATCHING;

APPROXIMATION ALGORITHMS;

EID: 79960098377     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21458-5_24     Document Type: Conference Paper

References (18)

1. Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. IEEE/ACM Trans. Comput. Biology Bioinform. 2(4), 302-315 (2005)
2. Christie, D.A., Irving, R.W.: Sorting strings by reversals and by transpositions. SIAM J. Discrete Math. 14(2), 193-206 (2001)
3. Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. ACM Transactions on Algorithms 1(2), 350-366 (2005)
4. Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proceedings of the Annual Symposium on Discrete Algorithms (SODA), pp. 667-676 (2002)
5. Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS 1997: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 137. IEEE Computer Society, Los Alamitos (1997)
6. Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: Hardness and approximations. Electr. J. Comb. 12(1) (2005)
7. Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. J. ACM 46(1), 1-27 (1999)
8. Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 45-52. Springer, Heidelberg (2010)
9. Kaplan, H., Shafrir, N.: The greedy algorithm for edit distance with moves. Inf. Process. Lett. 97(1), 23-27 (2006)
10. Kolman, P.: Approximating reversal distance for strings with bounded number of duplicates. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 580-590. Springer, Heidelberg (2005)
11. Kolman, P., Walen, T.: Reversal distance for strings with duplicates: Linear time approximation using hitting set. Electr. J. Comb. 14(1) (2007)
12. Kruskal, J., Sankoff, D.: Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading (1999)
13. Lopresti, D.P., Tomkins, A.: Block edit models for approximate string matching. Theor. Comput. Sci. 181(1), 159-179 (1997)
14. McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262-272 (1976)
15. Shapira, D., Storer, J.A.: Edit distance with move operations. J. Discrete Algorithms 5(2), 380-392 (2007)
16. Tichy, W.F.: The string-to-string correction problem with block moves. ACM Trans. Comput. Syst. 2(4), 309-321 (1984)
17. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249-260 (1995)
18. Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, pp. 1-11. IEEE, Los Alamitos (1973)