Semi-local longest common subsequences in subquadratic time

Journal of Discrete Algorithms

Volumn 6, Issue 4, 2008, Pages 570-581

  Tiskin, Alexander ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Longest common subsequence; Semi local string comparison; String algorithms

Indexed keywords

DATA STRUCTURES; DATA TRANSFER; FILE ORGANIZATION; OBJECT RECOGNITION;

COMPUTING; EFFICIENT; EXPLICIT REPRESENTATIONS; GENERALISATION; GEOMETRIC DATA STRUCTURES; LONGEST COMMON SUBSEQUENCE; LONGEST COMMON SUBSEQUENCES; OUTPUT REPRESENTATIONS; RUNNING INS; RUNNING TIMES; SEMI-LOCAL STRING COMPARISON; STRING ALGORITHMS; SUBSTRING; SUBSTRINGS;

BOOLEAN FUNCTIONS;

EID: 54449083748     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2008.07.001     Document Type: Article

References (22)

1. Aho A.V., Hirschberg D.S., and Ullman J.D. Bounds on the complexity of the longest common subsequence problem. Journal of the ACM 23 (1976) 1-12
2. Alves C.E.R., Cáceres E.N., and Song S.W. An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics 19 (2005) 133-139
3. Apostolico A. String editing and longest common subsequences. Handbook of Formal Languages vol. 2 (1997), Springer-Verlag 361-398
4. Arlazarov V.L., Dinic E.A., Kronrod M.A., and Faradzev I.A. On economical construction of the transitive closure of an oriented graph. Soviet Mathematical Doklady 11 (1970) 1209-1210
5. Bentley J.L. Multidimensional divide-and-conquer. Communications of the ACM 23 4 (1980) 214-229
6. Burkard R.E., Klinz B., and Rudolf R. Perspectives of Monge properties in optimization. Discrete Applied Mathematics 70 (1996) 95-161
7. Crochemore M., Landau G.M., Schieber B., and Ziv-Ukelson M. Re-use dynamic programming for sequence alignment: An algorithmic toolkit. String Algorithmics. Texts in Algorithmics vol. 2 (2004), King's College Publications
8. Crochemore M., Landau G.M., and Ziv-Ukelson M. A subquadratic sequence alignment algorithm for unrestricted score matrices. SIAM Journal on Computing 32 6 (2003) 1654-1673
9. Crochemore M., and Rytter W. Text Algorithms (1994), Oxford University Press
10. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press
11. JáJá J., Mortensen C., and Shi Q. Space-efficient and fast algorithms for multidimensional dominance reporting and counting. Proceedings of the 15th ISAAC. Lecture Notes in Computer Science vol. 3341 (2004), Springer 558-568
12. Jones N.C., and Pevzner P.A. An introduction to bioinformatics algorithms. Computational Molecular Biology (2004), The MIT Press
13. Kim S.-R., and Park K. A dynamic edit distance table. Journal of Discrete Algorithms 2 (2004) 303-312
14. Landau G.M., Myers E., and Ziv-Ukelson M. Two algorithms for LCS consecutive suffix alignment. Proceedings of the 15th CPM. Lecture Notes in Computer Science vol. 3109 (2004), Springer 173-193
15. Landau G.M., Myers E.W., and Schmidt J.P. Incremental string comparison. SIAM Journal on Computing 27 2 (1998) 557-582
16. Landau G.M., and Ziv-Ukelson M. On the common substring alignment problem. Journal of Algorithms 41 (2001) 338-359
17. Masek W.J., and Paterson M.S. A faster algorithm computing string edit distances. Journal of Computer and System Sciences 20 (1980) 18-31
18. Navarro G. A guided tour to approximate string matching. ACM Computing Surveys 33 1 (2001) 31-88
19. Preparata F.P., and Shamos M.I. Computational Geometry: An Introduction. Texts and Monographs in Computer Science (1985), Springer
20. Schmidt J.P. All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM Journal on Computing 27 4 (1998) 972-992
21. Tiskin A. All semi-local longest common subsequences in subquadratic time. Proceedings of CSR. Lecture Notes in Computer Science vol. 3967 (2006), Springer 352-363
22. Tiskin A. Longest common subsequences in permutations and maximum cliques in circle graphs. Proceedings of CPM. Lecture Notes in Computer Science vol. 4009 (2006), Springer 271-282