Shortest path approaches for the longest common subsequence of a set of strings

Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE

Volumn , Issue , 2007, Pages 327-333

  Barsky, Marina ^a   Stege, Ulrike ^a   Thomo, Alex ^a   Upton, Chris ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; SYSTEMS ENGINEERING;

HIGHER DIMENSIONS; INPUT STRINGS; LONGEST COMMON SUBSEQUENCES; NEW APPROACHES; PRACTICAL SOLUTIONS; SHORTEST PATHS; SPACE COMPLEXITIES;

OBJECT RECOGNITION;

EID: 47649108140     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBE.2007.4375584     Document Type: Conference Paper

References (25)

1. BAEZA-YATES R.A. Searching subsequences. Theoretical Computer Science 78(2): 363-376, 1992.
2. BERGROTH L., HAKONEN H., AND RAITA T. A survey of longest common subsequence algorithms. SPIRE'00: 39-48, 2000.
3. BEREG S, KUBICA M., WALEN T., ZHU B. RNA multiple structural alignment with longest common subsequences. Journal of Combinatorial Optimization 13(2): 179-188, 2007.
4. DAY. H. E. W, MCMORRIS F. R. The computation of consensus patterns in DNA sequences. Mathematical and Computer Modelling 17(10): 49-52, 1993.
5. DIXON N. R., MARTIN T. B. Automatic speech and speaker recognition. IEEE Press, New York., 1979.
6. ELLOUMI M. Comparison of strings belonging to the same family. Inf. Sci. 111 (1-4): 49-63, 1998.
7. FRENCH J., POWELL A., AND SCHULMAN E. Applications of approximate word matching in information retrieval. CIKM'97: 9-15, 1997.
8. GUSFIELD D. Algorithms on Strings, Trees and Sequences. Cambridge University Press, 1997.
9. HIRCHENBERG D.S. A linear space algorithm for computing maximal common subsequences. Communications of the ACM 18(6): 341-343, 1975.
10. HAKATA K., IMAI H. The longest common subsequence problem for small alphabet size between many strings. Algorithms and Computation: LNCS 650: 469-478, 1992.
11. HSU W., DU M. Computing a longest common subsequence for a set of strings. BIT 24:45-59, 1984.
12. IRVING R.W., FRASER C.B. Two algorithms for the longest common subsequence of three (or more) strings. CPM, LNCS 644: 214-229, 1992.
13. ITOGA S.Y. The string merging problem. BIT 21: 20-30, 1981.
14. KUO S., AND CROSS, G.R. An improved algorithm to find the length of the longest common subsequence of two strings. ACM SIGIR 23(3): 89-99, 1989.
15. MAIER D. The complexity of some problems on subsequences and supersequences. Journal of the ACM 25(2): 322-336, 1978.
16. MILLER W., MYERS, E.W. A file comparison problem. Softw. Pract. Exp. 15(11): 1025-1040, 1985.
17. MYERS, E.W. An O(ND) difference algorithm and its variations. Algorithmica 1: 251-266, 1986.
18. NEEDLEMAN S.B., WUNSH C.D. A general method applicable to the search for similarities in the amino-acid sequence of two proteins. Journal of Molecular Biology 48: 443-453, 1970.
19. NING K., KEE NG H., WAI LEONG H. Finding Patterns in Biological Sequences by Longest Common Subsequences and Shortest Common Supersequences. BIBE'06: 53-60, 2006.
20. SANKOFF D., KRUSKAL J.B. (EDS.) Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison. Addison-Wesley, MA, 1983.
21. SEDGEWICK R., VITTER S. Shortest paths in Euclidean graphs. Algorithmica 1: 31-48, 1986.
22. STEPHEN G.A. String Searching Algorithms. World Scientific, Singapore, 1994.
23. WAGNER R.A., FISHER M.J. The string-to-string correction problem. Journal of the ACM 21(1): 168-173, 1974.
24. WATERMAN, M. S. Introduction to computational biology: maps, sequences, and genomes. Chapman & Hall/CRC, 1995.
25. WU S., MANBER U., MYERS, G., MILLER W. An O(NP) sequence comparison algorithm. Inf. Proc. Lett. 35: 317-323, 1990.