Two algorithms for LCS consecutive suffix alignment

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

Volumn 3109, Issue , 2004, Pages 173-193

  Landau, Gad M ^a,d   Myers, Eugene ^b   Ziv Ukelson, Michal ^c  

^a UNIVERSITY OF HAIFA   (Israel)

^b POLYTECHNIC UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALIGNMENT; PATTERN MATCHING;

ALIGNMENT PROBLEMS; SEQUENCE SIMILARITY; SPACE ALGORITHMS; STRING COMPARISON; TIME AND SPACE ALGORITHMS;

ALGORITHMS;

EID: 35048833282     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_13     Document Type: Article

References (15)

1. A. Apostolico, String editing and longest common subsequences. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Vol. 2, 361-398, Berlin, 1997. Springer Verlag.
2. Apostolico A., and C. Guerra, The longest common subsequence problem revisited. Algorithmica, 2, 315-336 (1987).
3. Carmel, D., N. Efraty , G.M. Landau, Y.S. Maarek and Y. Mass, An Extension of the Vector Space Model for Querying XML Documents via XML Fragments, ACM SIGIR'2002 Workshop on XML and IR, Tampere, Finland, Aug 2002.
4. Eppstein, D., Z. Galil, R. Giancarlo, and G.F. Italiano, Sparse Dynamic Programming I: Linear Cost Functions, JACM, 39, 546-567 (1992).
5. Hirshberg, D.S., "Algorithms for the longest common subsequence problem", JACM, 24(4), 664-675 (1977).
6. Hunt, J. W. and T. G. Szymanski. "A fast algorithm for computing longest common subsequences." Communications of the ACM , 20 350-353 (1977).
7. Kim, S., and K. Park, "A Dynamic Edit Distance Table.", Proc. 11th Annual Symposium On Combinatorial Pattern Matching, 60-68 (2000).
8. Landau, G.M., E.W. Myers and J.P. Schmidt, Incremental string comparison, SIAM J. Comput., 27, 2, 557-582 (1998).
9. Landau, G.M. and M. Ziv-Ukelson, On the Shared Substring Alignment Problem, Proc. Symposium On Discrete Algorithms, 804-814 (2000).
10. Landau, G.M., and M. Ziv-Ukelson, On the Common Substring Alignment Problem, Journal of Algorithms, 41(2), 338-359 (2001)
11. G. M. Landau, B. Schieber and M. Ziv-Ukelson, Sparse LCS Common Substring Alignment, CPM 2003, 225-236
12. Myers, E. W., "Incremental Alignment Algorithms and their Applications," Tech. Rep. 86-22, Dept. of Computer Science, U. of Arizona. (1986).
13. Myers, E. W., "An O(ND) Difference Algorithm and its Variants," Algorithmica, 1(2): 251-266 (1986).
14. Schmidt, J.P., All Highest Scoring Paths In Weighted Grid Graphs and Their Application To Finding All Approximate Repeats In Strings, SIAM J. Comput, 27(4), 972-992 (1998).
15. Sim, J.S., C.S. Iliopoulos and K. Park, "Approximate Periods of Strings." Proc. 10th Annual Symposium On Combinatorial Pattern Matching, 132-137 (1999).