A sub-quadratic sequence alignment algorithm for unrestricted cost matrices

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 679-688

  Crochemore, Maxime ^a   Landau, Gad M ^b,c   Ziv Ukelson, Michal ^b,d  

^a Université de Marne la Vallée   (France)

^b UNIVERSITY OF HAIFA   (Israel)

^c POLYTECHNIC UNIVERSITY   (United States)

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; MATRIX ALGEBRA;

ALPHABET SIZE; COST MATRICES; GLOBAL ALIGNMENT; QUADRATIC TIME; SCORING MATRICES; SEQUENCE ALIGNMENTS; SPEED UP; TIME COMPLEXITY;

ALGORITHMS;

EID: 84968754816     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (45)

1. Aggarwal, A., M. Klawe, S. Moran, P. Shor, and R. Wilber, Geometric Applications of a Matrix-Searching Algorithm, Algorithmic, 2, 195-208 (1987).
2. Aggarawal, A., and J. Park, Notes on Searching in Multidimensional Monotone Arrays, Proc. 29th IEEE Symp. on Foundations of Computer Science, 497-512 (1988).
3. Amir, A., G. Benson, and M. Farach, Let sleeping files he: Pattern matching in Z-compressed files. J. of Comp. and Sys. Sciences, 52(2), 299-307 (1996).
4. Apostolico, A., M. Atallah, L. Larmore, and S. Mc-Faddin, Efficient parallel algorithms for string editing problems. SIAM J. Comput., 19, 968-998 (1990).
5. Bell, T.C., J.C. Cleary, and I.H. Witten. Text Compression. Prentice Hall, (1990).
6. Benson, G., A space efficient algorithm for finding the best nonoverlapping alignment score, Theoretical Computer Science, 145, 357-369 (1995).
7. Crochemore, M., and W. Rytter, Text Algorithms, Oxford University Press, (1994).
8. Eppstein, D., Sequence Comparison with Mixed Convex and Concave Costs, Journal of Algorithms, 11, 85-101 (1990).
9. Eppstein, D., Z. Galil, and Ft. Giancarlo, Speeding Up Dynamic Programming, Proc. 29th IEEE Symp. on Foundations of Computer Science, 488-496 (1988).
10. Eppstein, D., Z. Galil, R. Giancarlo, and G.F. Italiano, Sparse Dynamic Programming I: Linear Cost Functions, JACM, 39, 546-567 (1992).
11. Eppstein, D., Z. Galil, R. Giancarlo, and G.F. Italiano, Sparse Dynamic Programming II: Convex and Concave Cost Functions, JACM, 39, 568-599 (1992).
12. Erickson, B.W., and P.H. Sellers, Recognition of patterns in genetic sequences, in Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, D. Sankoff and J.B. Kruskal, eds., Addison-Wesley, Reading, MA, 55-91 (1983).
13. Farach, M., and M. Thorup, String matching in Lempel-Ziv compressed strings. Algorithmica, 20, 388-404 (1998).
14. Galil, Z., and R. Giancarlo, Speeding Up Dynamic Programming with Applications to Molecular Biology, Theoretical Computer Science, 64, 107-118 (1989).
15. Galil Z., and K. Park, A linear-time algorithm for concave one-dimensional dynamic programming, Info. Processing Letters, 33, 309-311 (1990).
16. Gasieniec, L., M. Karpinski, W. Plandowski, W. Ryt-ter, Randomised efficient algorithms for compressed strings: the finger-print approach, Proc. 7th Annual Symposium On Combinatorial Pattern Matching, LNCS 1075, 39-49 (1996).
17. Gasieniec, L., and W. Rytter, Almost optimal fully LZW compressed pattern matching, Data Compression Conference, J. Storer, ed, (1999).
18. Giancarlo, R. , Dynamic Programming: Special Cases, Pattern Matching Algorithms, edited by Apostolico, A. and Z. Galil, Oxford University Press, 201-232 (1997).
19. Gusfield, D., Algorithms on Strings, Trees, and Sequences. Cambridge University Press, (1997).
20. Kannan, S. K., and E. W. Myers, An Algorithm For Locating Non-Overlapping Regions of Maximum Alignment Score, SIAM J. Comput., 25(3), 648-662 (1996).
21. Karkkadnen, J., G. Navarro and E. Ukkonen, Approximate String Matching over Ziv-Lempel Compressed Text, Proc. 11th Annual Symposium On Combinatorial Pattern Matching, LNCS 1848, 195-209 (2000).
22. Karkkadnen, J., and E. Ukkonen, Lempel-Ziv parsing and sublinear-size index structures for string matching, Proc. Third South American Workshop on String Processing (WSP '96), 141-155 (1996).
23. Kida, T., M. Takeda, A. Shinohara, M. Miyazaki, and S. Arikawa, Shift-And approach to pattern matching in LZW compressed text, Proc. 10th Annual Symposium On Combinatorial Pattern Matching, LNCS 1645, 1-13 (1999).
24. Klawe, M., and D. Kleitman, An Almost Linear Algorithm for Generalized Matrix Searching, SIAM Jour. Descrete Math., 3, 81-97 (1990).
25. Landau, G.M., E.W. Myers and J.P. Schmidt, Incremental String Comparison, SIAM J. Comput., 27(2), 557-582 (1998).
26. Landau, G.M. and M. Ziv-Ukelson, On the Shared Substring Alignment Problem, Proc. Symposium On Discrete Algorithms, 804-814 (2000).
27. Landau, G.M., and M. Ziv-Ukelson, On the Common Substring Alignment Problem, Journal of Algorithms.
28. Lempel, A., and J. Ziv, On the complexity of finite sequences, IEEE Transactions on Information Theory, 22, 75-81 (1976).
29. Levenshtein, V.I., Binary Codes Capable of Correcting, Deletions, Insertions and Reversals, Soviet Phys. Dokl, 10, 707-710 (1966).
30. Manber, U., A text compression scheme that allows fast searching directly in the compressed file, Proc. 5th Annual Symposium On Combinatorial Pattern Matching, LNCS 807, 113-124 (1994).
31. Masek, W.J., and M.S. Paterson, A faster algorithm for computing string edit distances. J. Comput. Syst. Sci., 20, 18-31 (1980).
32. Monge, G-, Deblai et Remblai, Memoires del I'Academie des Sciences, Paris (1781).
33. Navarro G., T. Kida, M. Takeda, A. Shinohara, and S. Arikawa: Faster Approximate String Matching Over Compressed Text, Proc. Data Compression Conference (DCC2001), IEEE Computer Society, 459-468 (2001).
34. Navarro, G., and M. Raffinot, A general practical approach to pattern matching over Ziv-Lempel compressed text, Proc. 10th Annual Symposium On Combinatorial Pattern Matching, LNCS 1645, 14-36 (1999).
35. Navarro, G., and M. Raffinot. Boyer-Moore string matching over Ziv-Lempel compressed text, Proc. 11th Annual Symposium On Combinatorial Pattern Matching, LNCS 1848, 166-180 (2000).
36. Sankoff D., and J.B. Kruskal (editors), Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, MA, (1983).
37. 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).
38. Shabita Y., T. Kida, S. Fukamachi, M. Takeda, A. Shinohara, T. Shinohara, S. Arikawa, Speeding up pattern matching by text compression, CI AC 2000, LNCS 1767, 306-315 (2000).
39. Smith, T. F. and M. S. Waterman, Identification of common molecular subsequences, J. Molecular Biol., 147, 195-197 (1981).
40. Szpankowski, W., and P. Jacquet. Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees, Theoretical Computer Science, 144, 161-197 (1995).
41. Takeda, M., Y. Shibata, T. Matsumoto, T. Kida, A. Shinohara, S. Fukamachi, T. Shinohara, and S. Arikawa: Speeding up string pattern matching by text compression: The dawn of a new era, 42(3), pp. 370-384 (2001).
42. Waterman, M.S., and M. Eggert, A new algorithm for best subsequence alignment with application to tRNA-rRNA comparisons, J. Molecular Biol., 197, 723-728 (1987).
43. Welch, T.A., A Technique for High Performance Data Compression, IEEE Trans, on Computers, 17(6), 8-19 (1984).
44. Ziv, J., and A. Lempel, A Universal Algorithm for Sequential Data Compression, IEEE Transactions on Information Theory, IT-23(3), 337-343 (1977).
45. Ziv, J., and A. Lempel, Compression of individual sequences via variable rate coding, IEEE Trans. Inform. Th., 24, 530-536 (1978).