Sparse LCS Common Substring Alignment

Information Processing Letters

Volumn 88, Issue 6, 2003, Pages 259-270

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

^a UNIVERSITY OF HAIFA   (Israel)

^b POLYTECHNIC UNIVERSITY   (United States)

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

Author keywords

Algorithms; Common Substring Alignment; LCS; Sparsity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; ENCODING (SYMBOLS); PROBLEM SOLVING;

LONGEST COMMON SUBSEQUENCES (LCS); SUBSTRING ALIGNMENT;

DATA PROCESSING;

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

References (30)

1. Apostolico A. String editing and longest common subsequences. Rozenberg G., Salomaa A. Linear Modeling: Background and Application. Handbook of Formal Languages. 2:1997;Springer Verlag, Berlin. chapter 8, pp. 361-398.
2. Apostolico A., Guerra C. The longest common subsequence problem revisited. Algorithmica. 2:1987;315-336.
3. Aggarwal A., Klawe M., Moran S., Shor P., Wilber R. Geometric applications of a matrix searching algorithm. Algorithmica. 2:1987;195-208.
4. Benson G. A space efficient algorithm for finding the best nonoverlapping alignment score. Theoret. Comput. Sci. 145:(1-2):1995;357-369.
5. Buechner A.G., Mulvenna M. Discovering Internet marketing intelligence through online analytical web usage mining. SIGMOD Record. 27:(4):1998;54-61.
6. Chen M.S., Park J.S., Yu P.S. Data mining for path traversal patterns in a web environment. 16th Internat. Conf. on Distributed Computing Systems. 1996;385-392.
7. Crochemore M., Landau G.M., Ziv-Ukelson M. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms. 2002;679-688.
8. Eppstein D., Galil Z., Giancarlo R., Italiano G.F. Sparse dynamic programming. I. Linear cost functions. J. ACM. 39:1992;519-545.
9. Eppstein D. Sequence comparison with mixed convex and concave costs. J. Algorithms. 11:1990;85-101.
10. Eppstein D., Galil Z., Giancarlo R. Speeding up dynamic programming. Proc. 29th IEEE Symp. on Foundations of Computer Science. 1988;296-488.
11. Farrell R., Fairweather P., Breimer E. A task-based architecture for application-aware adjuncts. Proc. 2000 Internat. Conf. on Intelligent User Interfaces. 2000;82-85 ACM Press, New York.
12. Galil Z., Giancarlo R. Speeding up dynamic programming with applications to molecular biology. Theoret. Comput. Sci. 64:1989;107-118.
13. Galil Z., Park K. A linear-time algorithm for concave one-dimensional dynamic programming. Inform. Process. Lett. 33:1990;309-311.
14. Gelfand M.S., Mironov A.A., Pevzner P.A. Gene recognition via spliced sequence alignment. Proc. Natl. Acad. Sci. USA. 93:1996;9061-9066.
15. Giancarlo R. Dynamic programming: special cases. Apostolico A., Galil Z. Pattern Matching Algorithms. 1997;201-232 Oxford University Press.
16. Gusfield D. Algorithms on Strings, Trees, and Sequences. 1997;Cambridge University Press.
17. Hirschberg D.S. Algorithms for the longest common subsequence problem. J. ACM. 24:(4):1977;664-675.
18. Hunt J.W., Szymanski T.G. A fast algorithm for computing longest common subsequences. Comm. ACM. 20:(5):1977;350-353.
19. Kannan S.K., Myers E.W. An algorithm for locating non-overlapping regions of maximum alignment score. SIAM J. Comput. 25:(3):1996;648-662.
20. Klawe M., Kleitman D. An almost linear algorithm for generalized matrix searching. SIAM J. Discrete Math. 3:1990;81-97.
21. Landau G.M., Ziv-Ukelson M. On the shared substring alignment problem. Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms. 2000;804-814.
22. Landau G.M., Ziv-Ukelson M. On the common substring alignment problem. J. Algorithms. 41:(2):2001;338-359.
23. Lee J., Podlaseck M., Schonberg E., Hoch R. Visualization and analysis of clickstream data of online stores for understanding web merchandising. J. Data Mining Knowledge Discovery. 5:(1/2):2001;59-84.
24. Mironov A.A., Roytberg M.A., Pevzner P.A., Gelfand M.S. Performance-guarantee gene predictions via spliced alignment. Genomics. 51:1998;332-339.
25. Mighell A.J., Markham A.F., Robinson P.A. Alu sequences. FEBS Lett. 417:1997;1-5.
26. Monge G. Déblai et Remblai, Mémoires de l'Academie des Sciences, Paris. 1781.
27. E.W. Myers, Incremental alignment algorithms and their applications, Tech. Rep. 86-22, Dept. of Computer Science, Univ. of Arizona, 1986.
28. Romero D., Martinez-Salazar J., Ortiz E., et al. Repeated sequences in bacterial chromosomes and plasmids: a glimpse from sequenced genomes. Res. Microbiol. 150:1999;735-743.
29. 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):1998;972-992.
30. Snapp S.R., Brentano J., Dias G.V., Goan T.L., Grance T., Heberlein L.T., Ho C., Levitt K.N., Mukerjee B., Mansur D.L., Pon K.L., Smaha S.E. A system for distributed intrusion detection. COMPCON Spring 91 - the 36th IEEE International Computer Conference. 1991;170-176.