Experimenting an approximation algorithm for the LCS

Discrete Applied Mathematics

Volumn 110, Issue 1, 2001, Pages 13-24

  Bonizzoni, Paola ^a   Vedova, Gianluca Della ^a   Mauri, Giancarlo ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035371879     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00300-0     Document Type: Article

References (19)

1. Aho A., Hopcroft J., Ullman J. Data Structures and Algorithms. 1983;Addison-Wesley, Reading, MA.
2. Apostolico A., Guerra C. The longest common subsequence problem revisited. Algorithmica. 18(1):1987;1-11.
3. Arlazarov V., Dinic E., Kronrod M., Faradzev I. On the economic construction of the transitive closure of a direct graph. Sov. Math. Dokl. 11(5):1970;1209-1210.
4. P. Bonizzoni, A. Ehrenfeucht, Approximation of the shortest common supersequence with ratio less than the alphabet size, Technical Report TR 149-95, Dipartimento di Scienze Della Informazione, Universitá Degli Studi di Milano, 1996.
5. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
6. Gusfield D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. 1997;Cambridge University Press, Cambridge.
7. K. Hakata, H. Imai, The longest common subsequence problem for small alphabet size between many strings, in: Proceedings of the Third International Symposium on Algorithms and Computation (ISAAC), Vol. 650, LNCS, Springer, Berlin, 1992, pp. 469-478.
8. Hirschberg D.S. A linear space algorithm for computing maximal common subsequences. Commun. ACM. 18(6):1975;341-343.
9. Hsu W., Du M. New algorithms for the LCS problem. J. Comput. Sys. Sci. 19:1984;133-152.
10. Jacobson G., Vo K.-P. Heaviest increasing. / common subsequence problem Apostolico A., Crochemore M., Galil Z. Proceedings of the Third Combinatorial Pattern Matching, Vol. 644, LNCS. 1992;52-66 Springer, Berlin.
11. Jiang T., Li M. On the approximation of shortest common supersequences and longest common subsequences. SIAM J. Comput. 24(5):1995;1122-1139.
12. W.-H. Li, Molecular Evolution, Sinauer Association, Sunderland, MA, 1997.
13. Maier D. The complexity of some problems on subsequences and supersequences. J. ACM. 25:1978;322-336.
14. Masek W., Paterson M. A faster algorithm computing string edit distances. J. Comput. Sys. Sci. 20(1):1980;18-31.
15. Paterson M., Dancik V. Longest common subsequences. Prívara I., Rovan B., Ruzicka P. Mathematical Foundations of Computer Science, 19th International Symposium, Vol. 841, LNCS, Kosice, Slovakia. 1994;127-142 Springer, Berlin.
16. Pevzner P. Matrix longest common subsequence problem, duality and Hilbert bases. Apostolico A., Crochemore M., Galil Z. Proceedings of the Third Combinatorial Pattern Matching, Vol. 644, LNCS. 1992;79-89 Springer, Berlin.
17. Rick C. A new flexible algorithm for the longest common subsequence problem. Galil Z., Ukkonen E. Proceedings of the Fifth Combinatorial Pattern Matching, Vol. 937, LNCS. 1995;340-351 Springer, Berlin.
18. Sankoff D., Kruskal (Eds.) J. Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparisons. 1983;Addison-Wesley, Reading, MA.
19. Smith T., Waterman M. Identification of common molecular subsequences. J. Molecular Biology. 147:1981;195-197.