New efficient algorithms for the LCS and constrained LCS problems

Information Processing Letters

Volumn 106, Issue 1, 2008, Pages 13-18

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

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Algorithms; Combinatorial problems; Longest common subsequence

Indexed keywords

COMPUTATIONAL COMPLEXITY; NUMERICAL METHODS; PROBLEM SOLVING;

COMBINATORIAL PROBLEMS; CONSTRAINED LCS (CLCS); LONGEST COMMON SUBSEQUENCE (LCS) PROBLEMS;

ALGORITHMS;

EID: 38849185311     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.09.008     Document Type: Article

References (18)

1. Arlazarov V., Dinic E., Kronrod M., and Faradzev I. On economic construction of the transitive closure of a directed graph. Soviet Physics-Doklady 11 (1975) 1209-1210 English translation
2. Arslan A.N., and Eǧecioǧlu O. Algorithms for the constrained longest common subsequence problems. In: Simánek M., and Holub J. (Eds). The Prague Stringology Conference (2004), Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 24-32
3. Arslan A.N., and Eǧecioǧlu O. Algorithms for the constrained longest common subsequence problems. International Journal of Foundations Computer Science 16 6 (2005) 1099-1109
4. Bergroth L., Hakonen H., and Raita T. A survey of longest common subsequence algorithms. String Processing and Information Retrieval (SPIRE) (2000), IEEE Computer Society 39-48
5. Brodal G.S., Kaligosi K., Katriel I., and Kutz M. Faster algorithms for computing longest common increasing subsequences. In: Lewenstein M., and Valiente G. (Eds). Annual Symposium on Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science vol. 4009 (2006), Springer 330-341
6. Chin F.Y.L., Santis A.D., Ferrara A.L., Ho N.L., and Kim S.K. A simple algorithm for the constrained sequence problems. Information Processing Letters 90 4 (2004) 175-179
7. M. Crochemore, G.M. Landau, M. Ziv-Ukelson, A sub-quadratic sequence alignment algorithm for unrestricted cost matrices, in: Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 679-688
8. Hunt J.W., and Szymanski T.G. A fast algorithm for computing longest subsequences. Communications of the ACM 20 5 (1977) 350-353
9. Jiang T., and Li M. On the approximation of shortest common supersequences and longest common subsequences. SIAM Journal on Computing 24 5 (1995) 1122-1139
10. Levenshtein V. Binary codes capable of correcting spurious insertions and deletions of ones. Problems in Information Transmission 1 (1965) 8-17
11. Maier The complexity of some problems on subsequences and supersequences D. Journal of the ACM 25 2 (1978) 322-336
12. Masek W.J., and Paterson M. A faster algorithm computing string edit distances. Journal of Computer and System Sciences 20 1 (1980) 18-31
13. Myers E.W. An O(ND) difference algorithm and its variations. Algorithmica 1 2 (1986) 251-266
14. Nakatsu N., Kambayashi Y., and Yajima S. A longest common subsequence algorithm suitable for similar text strings. Acta Informatica 18 (1982) 171-179
15. Rahman M.S., and 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 (2006), Springer 399-408
16. Rahman M.S., and Iliopoulos C.S. A new efficient algorithm for computing the longest common subsequence. In: Kao M.-Y., and Li X.-Y. (Eds). AAIM. Lecture Notes in Computer Science vol. 4508 (2007), Springer 82-90
17. Tsai Y.-T. The constrained longest common subsequence problem. Information Processing Letters 88 4 (2003) 173-176
18. Wagner R.A., and Fischer M.J. The string-to-string correction problem. Journal of the ACM 21 1 (1974) 168-173