On the Common Substring Alignment Problem

Journal of Algorithms

Volumn 41, Issue 2, 2001, Pages 338-359

  Landau, Gad M ^a,b   Ziv Ukelson, Michal ^a,c  

^a UNIVERSITY OF HAIFA   (Israel)

^b POLYTECHNIC UNIVERSITY   (United States)

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

Author keywords

Candidate lists; Design and analysis of algorithms; Dynamic programming; Monge arrays; Repeated substrings; Sequence comparison; Shared substrings

Indexed keywords

EID: 0012526495     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1191     Document Type: Article

References (31)

1. A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber, Geometric applications of a matrix-searching algorithm, Algorithmica 2 (1987), 195-208 .
2. A. Aggarawal and J. Park, Notes on searching in multidimensional monotone Arrays, in "Proceedings of the 29th IEEE Symposium on Foundations of Computer Science," pp. 497-512, 1988.
3. A. Apostolico, M. Atallah, L. Larmore, and S. McFaddin, Efficient parallel algorithms for string editing problems, SIAM J. Comput. 19 (1990), 968-998.
4. G. Benson, A space efficient algorithm for finding the best nonoverlapping alignment score, Theoret. Comput. Sci. 145 (1995), 357-369.
5. A. G. Buechner and M. Mulvenna, Discovering internet marketing intelligence through online analytical web usage mining, SIGMOD Record 27 (1998), 54-61.
6. M. S. Chen, J. S. Park and P. S. Yu, Data mining for path traversal patterns in a web environment, in "The 16th International Conference on Distributed Computing Systems," pp. 385-392, 1996.
7. D. Eppstein, Z. Galil, and R. Giancarlo, Speeding up dynamic programming, in "Proceedings of the 29th IEEE Symposium on Foundations of Computer Science," pp. 488-296, 1988.
8. R. Farrell, P. Fairweather, and E. Breimer, A task-based architecture for application-aware adjuncts, in "Proceedings of the 2000 International Conference on Intelligent User Interfaces," pp. 82-85, Assoc. Comput. Mach., 2000.
9. H. N. Gabow and R. E. Tarjan, A linear time algorithm for a special case of disjoint set union, J. Comput. System Sci. 30 (1985), 209-221.
10. Z. Galil and R. Giancarlo, Speeding up dynamic programming with applications to molecular biology, Theoret. Comput. Sci. 64 (1989), 107-118.
11. M. S. Gelfand, A. A. Mironov, and P. A. Pevzner, Gene recognition via spliced sequence alignment, Proc. Natl. Acad. Sci. USA 93 (1996), 9061-9066.
12. R. Giancarlo, Dynamic Programming: Special cases, in "Pattern Matching Algorithms," (A. Apostolico and Z. Galil, Eds.), pp. 201-232, Oxford Univ. Press, London, 1997.
13. D. Gusfield, "Algorithms on Strings, Trees, and Sequences," Cambridge Univ. Press, Cambridge, UK, 1997.
14. D. S. Hirschberg, A linear space algorithm for computing maximal common subsequences, Comm. ACM 18, No. 6 (1975), 341-343.
15. D. S. Hirshberg and L. L. Larmore, The least weight subsequence problem, SIAM J. Comput. 16, No. 4 (1987), 628-638.
16. S. K. Kannan and E. W. Myers, An algorithm for locating non-overlapping regions of maximum alignment score, SIAM J. Comput. 25, No. 3 (1996), 648-662.
17. J. Karkkainen, G. Navarro, and E. Ukkonen, Approximate string matching over Ziv-Lempel compressed text, in "Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching," pp. 195-209, 2000.
18. G. M. Landau, E. W. Myers, and J. P. Schmidt, Incremental string comparison, SIAM J. Comput. 27, No. 2 (1998), 557-582.
19. G. M. Landau and M. Ziv-Ukelson, On the shared substring alignment problem, in "Proceedings of the Symposium on Discrete Algorithms," pp. 804-814, 2000.
20. J. Lee, M. Podlaseck, E. Schonberg, and R. Hoch, Visualization and analysis of clickstream data of online stores for understanding web merchandising, J. Data Mining Knowledge Discovery 5, Nos. 1/2 (2001), 59-84.
21. V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Soviet Phys. Dokl. 10 (1966), 707-710.
22. W. Miller and E. W. Myers, Sequence comparison with concave weighting functions, Bull. Math. Biol. 50 (1988), 97-100.
23. A. A. Mironov, M. A. Roytberg, P. A. Pevzner, and M. S. Gelfand, Performance-guarantee gene predictions via spliced alignment, Genomics 51 A.N. GE985251 (1998), 332-339.
24. G. Monge, Deblai et Remblai, Mem. Acad. Sci. Paris (1781).
25. E. W. Myers, Seeing conserved signals: Using algorithms to detect similarities between biosequences, in "Calculating the Secrets of Life," Lander and Waterman, Eds, pp. 56-89, National Academy Press, 1995.
26. M. A. Roytberg, T. V. Astakhova, and M. S. Gelfand, Combinatorial approaches to gene recognition, Comput. Chem. 21, No. 4 (1997), 229-235.
27. J. P. Schmidt, All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings, SIAM J. Comput. 27, No. 4 (1998), 972-992.
28. S. R. Snapp, J. Brentano, G. V. Dias, T. L. Goan, T. Grance, L. T. Heberlein, C. Ho, K. N. Levitt, B. Mukerjee, D. L. Mansur, K. L. Pon, and S. E. Smaha, A system for distributed intrusion detection, in "COMPCON Spring 91, the 36th IEEE International Computer Conference," pp. 170-176, 1991.
29. S. H. Sze and P. A. Pevzner, Las Vegas algorithms for gene recognition: Suboptimal and error-tolerant spliced alignment, J. Comp. Biol. 4, No. 3 (1997), 297-309.
30. E. Ukkonen, Finding approximate patterns in strings, J. Algorithms 6 (1985), 132-137.
31. M. Ziv-Ukelson, Y. Horesh, G. M. Landau, and R. Unger, Using repeats to speedup DNA sequence alignment, private communication.