A new efficient algorithm for computing the longest common subsequence

Theory of Computing Systems

Volumn 45, Issue 2, 2009, Pages 355-371

  Iliopoulos, Costas S ^a   Rahman, M Sohel ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Algorithms; Longest common subsequence; Strings

Indexed keywords

ALGORITHM FOR SOLVING; DNA SEQUENCE ANALYSIS; LONGEST COMMON SUBSEQUENCES; ORDERED PAIRS; STRINGS;

ALGORITHMS; MOLECULAR BIOLOGY;

PROBLEM SOLVING;

EID: 67449136303     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-008-9101-6     Document Type: Conference Paper

References (27)

1. V.L. Arlazarov E.A. Dinic M.A. Kronrod I.A. Faradzev 1975 On economic construction of the transitive closure of a directed graph (English translation) Sov. Math. Dokl. 11 1209 1210
2. Arslan, A.N., Egecioglu, Ö: Algorithms for the constrained longest common subsequence problems. In: Stringology, pp. 24-32 (2004)
3. A.N. Arslan Ö Egecioglu 2005 Algorithms for the constrained longest common subsequence problems Int. J. Found. Comput. Sci. 16 6 1099 1109 (Pubitemid 44099389)
4. Bender, M.A., Farach-Colton, M.: The lca problem revisited. In: LATIN, pp. 88-94 (2000)
5. Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: SPIRE, pp. 39-48 (2000)
6. Stølting Brodal, G., Kaligosi, K., Katriel, I., Kutz, M.: Faster algorithms for computing longest common increasing subsequences, pp. 330-341 (2006) (Pubitemid 44071998)
7. Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In: Symposium of Discrete Algorithms (SODA), pp. 679-688 (2002)
8. Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for geometry problems. In: STOC, pp. 135-143 (1984)
9. F. Hadlock 1988 Minimum detour methods for string or sequence comparison Congr. Numer. 61 263 274
10. D.S. Hirschberg 1977 Algorithms for the longest common subsequence problem J. ACM 24 4 664 675
11. J.W. Hunt T.G. Szymanski 1977 A fast algorithm for computing longest subsequences Commun. ACM 20 5 350 353
12. Iliopoulos, C.S., Rahman, M.S.: New efficient algorithms for the lcs and constrained lcs problems. Inf. Process. Lett. (to appear). doi: 10.1016/j.ipl.2007.09.008
13. Iliopoulos, C.S., Rahman, M.S.: Algorithms for computing variants of the longest common subsequence problem. Theor. Comput. Sci. (2007, to appear at a special issue)
14. Iliopoulos, C.S., Rahman, M.S.: New efficient algorithms for LCS and constrained LCS problem. In: Broersma, H., Dantchev, S.S., Johnson, M., Szeider, S. (eds.) ACiD, Texts in Algorithmics, vol. 9, pp. 83-94. King's College, London (2007)
15. T. Jiang M. Li 1995 On the approximation of shortest common supersequences and longest common subsequences SIAM J. Comput. 24 5 1122 1139
16. V.I. Levenshtein 1965 Binary codes capable of correcting deletions, insertions, and reversals Probl. Inf. Transm. 1 8 17
17. Ma, B., Zhang, K.: On the longest common rigid subsequence problem. In: CPM, pp. 11-20 (2005) (Pubitemid 41422510)
18. D. Maier 1978 The complexity of some problems on subsequences and supersequences J. ACM 25 2 322 336
19. W.J. Masek M. Paterson 1980 A faster algorithm computing string edit distances J. Comput. Syst. Sci. 20 1 18 31 (Pubitemid 10476340)
20. V. Mäkinen G. Navarro E. Ukkonen 2005 Transposition invariant string matching J. Algorithms 56 124 153 (Pubitemid 41085032)
21. E.W. Myers 1986 An o(nd) difference algorithm and its variations Algorithmica 1 2 251 266
22. N. Nakatsu Y. Kambayashi S. Yajima 1982 A longest common subsequence algorithm suitable for similar text strings Acta Inf. 18 171 179 (Pubitemid 13492481)
23. Rahman, M.S., Iliopoulos, C.S.: Algorithms for computing variants of the longest common subsequence problem. In: Asano, T. (ed.) ISAAC. Lecture Notes in Computer Science, vol. 4288, pp. 399-408. Springer, Berlin (2006)
24. Rahman, M.S., Iliopoulos, C.S.: A new efficient algorithm for computing the longest common subsequence. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM. Lecture Notes in Computer Science, vol. 4508, pp. 82-90. Springer, Berlin (2007)
25. Y.-T. Tsai 2003 The constrained longest common subsequence problem Inf. Process. Lett. 88 4 173 176
26. P. van Emde Boas 1977 Preserving order in a forest in less than logarithmic time and linear space Inf. Process. Lett. 6 80 82
27. R.A. Wagner M.J. Fischer 1974 The string-to-string correction problem J. ACM 21 1 168 173