A new efficient algorithm for computing the longest common subsequence

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

Volumn 4508 LNCS, Issue , 2007, Pages 82-90

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

^a KING'S COLLEGE LONDON   (United Kingdom)

^b BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING; PROBLEM SOLVING;

STRINGS; STRINGS MATCH;

ALGORITHMS;

EID: 38149023339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72870-2_8     Document Type: Conference Paper

References (20)

1. V.L. Arlazarov, E.A. Dinic, M.A. Kronrod, and I.A. Faradzev. On economic construction of the transitive closure of a directed graph (english translation). Soviet Math. Dokl., 11:1209-1210, 1975.
2. Abdullah N. Arslan and Ömer Egecioglu. Algorithms for the constrained longest common subsequence problems. Int. J. Found. Comput. Sci., 16(6): 1099-1109, 2005.
3. Michael A. Bender and Martin Farach-Colton. The lca problem revisited. In LATIN, pages 88-94, 2000.
4. Lasse Bergroth, Harri Hakonen, and Timo Raita. A survey of longest common subsequence algorithms. In SPIRE, pages 39-48, 2000.
5. Maxime Crochemore, Gad M. Landau, and Michal Ziv-Ukelson. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In Symposium of Discrete Algorithms (SODA), pages 679-688, 2002.
6. H. Gabow, J. Bentley, and R. Tarjan. Scaling and related techniques for geometry problems. In STOC, pages 135-143, 1984.
7. F. Hadlock. Minimum detour methods for string or sequence comparison. Congressus Numerantium, 61:263-274, 1988.
8. Daniel S. Hirschberg. Algorithms for the longest common subsequence problem. J. ACM, 24(4):664-675, 1977.
9. James W. Hunt and Thomas G. Szymanski. A fast algorithm for computing longest subsequences. Commun. ACM, 20(5):350-353, 1977.
10. Tao Jiang and Ming Li. On the approximation of shortest common supersequences and longest common subsequences. SIAM Journal of Computing, 24(5):1122-1139, 1995.
11. V.l. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Problems in Information Transmission, 1:8-17, 1965.
12. Bin Ma and Kaizhong Zhang. On the longest common rigid subsequence problem. In CPM, pages 11-20, 2005.
13. David Maier. The complexity of some problems on subsequences and supersequences. Journal of the ACM, 25(2):322-336, 1978.
14. William J. Masek and Mike Paterson. A faster algorithm computing string edit distances. J. Comput. Syst. Sci., 20(1):18-31, 1980.
15. Eugene W. Myers. An o(nd) difference algorithm and its variations. Algorithmica, l(2):251-266, 1986.
16. Narao Nakatsu, Yahiko Kambayashi, and Shuzo Yajima. A longest common subsequence algorithm suitable for similar text strings. Acta Inf., 18:171-179, 1982.
17. M. Sohel Rahman and Costas S. Iliopoulos. Algorithms for computing variants of the longest common subsequence problem. In ISAAC, pages 399-408, 2006.
18. Yin-Te Tsai. The constrained longest common subsequence problem. Inf. Process. Lett, 88(4):173-176, 2003.
19. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6:80-82, 1977.
20. Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168-173, 1974.