A new practical linear space algorithm for the longest common subsequence problem

Kybernetika

Volumn 38, Issue 1, 2002, Pages 45-66

  Goeman, Heiko ^a   Clausen, Michael ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DYNAMIC PROGRAMMING; MATRIX ALGEBRA; SET THEORY;

LINEAR SPACE ALGORITHMS;

PROBLEM SOLVING;

EID: 0036381873     PISSN: 00235954     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. A.V. Aho, D.S. Hirschberg, and J.D. Ullman: Bounds on the complexity of the longest common subsequence problem. J. Assoc. Comput. Mach. 23 (1976), 1, 1-12.
2. A. Apostolico: Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings. Inform. Process. Lett. 23 (1986), 63-69.
3. A. Apostolico: Remarks on the Hsu-Du new algorithm for the longest common sub-sequence problem. Inform. Process. Lett. 25 (1987), 235-236.
4. A. Apostolico and G. Guerra: The longest common subsequence problem revisited. Algorithmica 2 (1987), 315-336.
5. A. Apostolico, S. Browne, and C. Guerra: Fast linear-space computations of longest common subsequences. Theoret. Comput. Sci. 92 (1992), 3-17.
6. F.Y.L. Chin and C.K. Poon: A fast algorithm for computing longest common subsequences of small alphabet size. J. Inform. Process. 13 (1990), 4, 463-469.
7. V. Chvátal and D. Sankoff: Longest common subsequences of two random strings. J. Appl. Probab. 12 (1975), 306-315.
8. V. Dančík and M. Paterson: Upper bounds for the expected length of a longest common subsequence of two binary sequences. In: Proceedings 11th Annual Symp. on Theoretical Aspects of Computer Science (Lecture Notes in Computer Science 775), Springer-Verlag, Berlin 1994, pp. 669-678.
9. M.O. Dayhoff: Computer aids to protein sequence determination. J. Theoret. Biol. 8 (1965), 97-112.
10. M.O. Dayhoff: Computer analysis of protein evolution. Sci. Amer. 221 (1969), 1, 86-95.
11. J.G. Deken: Some limit results for longest common subsequences. Discrete Math. 26 (1979), 17-31.
12. R.P. Dilworth: A decomposition theorem for partially ordered sets. Ann. of Math. 51 (1950), 161-166.
13. K.S. Fu and B.K. Bhargava: Tree systems for syntactic pattern recognition. IEEE Trans. Comput. C-22 (1973), 12, 1087-1099.
14. J. Gallant, D. Maier, and J.A. Storer: On finding minimal length superstrings. J. Comput. System Sci. 20 (1980), 50-58.
15. H. Goeman: Time and Space Efficient Algorithms for Decomposing Certain Partially Ordered Sets. PhD Thesis, Department of Computer Science, University of Bonn 1999. To appear in Bayreuther Mathematische Schriften.
16. D.S. Hirschberg: A linear space algorithm for computing maximal common subsequences. Comm. ACM 18 (1975), 6, 341-343.
17. D.S. Hirschberg: Algorithms for the longest common subsequence problem. J. Assoc. Comput. Mach. 24 (1977), 4, 664-675.
18. W.J. Hsu and M.W. Du: New algorithms for the LCS problem. J. Comput. System Sci. 29 (1984), 133-152.
19. J.W. Hunt and T.G. Szymanski: A fast algorithm for computing longest common subsequences. Comm. ACM 20 (1977), 5, 350-353.
20. S.K. Kumar and C.P. Rangan: A linear space algorithm for the LCS problem. Acta Inform. 24 (1987), 353-363.
21. R. Lowrance and R.A. Wagner: An extension of the string-to-string correction problem. J. Assoc. Comput. Mach. 22, (1975), 2, 177-183.
22. S.Y. Lu and K.S. Fu: A sentence-to-sentence clustering procedure for pattern analysis. IEEE Trans. Systems Man Cybernet. SMC-8, (1978), 5, 381-389.
23. D. Maier: The complexity of some problem on subsequences and supersequences. J. Assoc. Comput. Mach. 25 (1978), 2, 322-336.
24. W.J. Masek and M.S. Paterson: A faster algorithm for computing string edit distances. J. Comput. System Sci. 20 (1980), 1, 18-31.
25. E.W. Myers: An O(ND) difference algorithm and its variations. Algorithmica 1 (1986), 251-266.
26. N. Nakatsu, Y. Kambayashi, and S. Yajima: A longest common subsequence algorithm suitable for similar text strings. Acta Inform. 18 (1982), 171-179.
27. S.B. Needleman and C.S. Wunsch: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Molecular Biol. 48 (1970), 443-453.
28. M. Paterson and V. Dančík: Longest common subsequences. In: Proceedings, 19th Intern. Symp. on Mathematical Foundations of Computer Science (Lecture Notes in Computer Science 841), Springer Verlag, Berlin 1994, pp. 127-142.
29. C. Rick: New Algorithms for the Longest Common Subsequence Problem. Research Report No. 85123-CS, Department of Computer Science, University of Bonn 1994.
30. C. Rick: A new flexible algorithm for the longest common subsequence problem. In: Proceedings, 6th Annual Symp. on Combinatorial Pattern Matching (Lecture Notes in Computer Science 937), Springer Verlag, Berlin 1995, pp. 340-351.
31. D. Sankoff and R.J. Cedergren: A test for nucleotide sequence homology. J. Molecular Biol. 77 (1973), 159-164.
32. D. Sankoff and J.B. Kruskal: Time Warps, String Edits, and Macromolecules: The Theory And Practice of Sequence Comparison. Addison-Wesley, Reading, MA 1983.
33. E. Ukkonen: Algorithms for approximate string matching. Inform. and Control 64 (1985), 100-118.
34. R.A. Wagner: On the complexity of the extended string-to-string correction problem. In: Proceedings, 7th Ann. ACM Sympos. on Theory of Comput. 1975, pp. 218-223.
35. R.A. Wagner and M.J. Fischer: The string-to-string correction problem. J. Assoc. Comput. Mach. 21 (1974), 1, 168-173.
36. C.K. Wong and A.K. Chandra: Bounds for the string editing problem. J. Assoc. Comput. Mach. 28 (1976), 1, 13-18.
37. S. Wu, U. Manber, G. Myers, and W. Miller: An O(NP) sequence comparison algorithm. Inform. Process. Lett. 35 (1990), 317-323.