A learning algorithm for the longest common subsequence problem

ACM Journal of Experimental Algorithmics

Volumn 8, Issue , 2003, Pages

  Breimer, Eric A ^a   Goldberg, Mark K ^a   Lim, Darren T ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85032070798     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/996546.996552     Document Type: Article

References (21)

1. BERRY, J. W. AND GOLDBERG, M. K. 1995. Path optimization and near-greedy analysis for graph partitioning: An empirical study. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (1995).
2. BONIZZONI, P., D'ALESSANDRO, M., VEDOVA, G. D., AND MAURI, G. 1998. Experimenting an approximation algorithm for the lcs. In Proceedings of the Workshop on Algorithms and Experiments (ALEX 98) (1998).
3. BONIZZONI, P. AND EHRENFEUCH, A. 1996. Approximation of the shortest common supersequence with ratio less than the alphabet size. In Technical Report TR 149-95 (1996). Dipartimento di Scienze Della Informazione, Universitá Degli Studi di Milano.
4. BREIMER, E. A. AND GOLDBERG, M. K. 1998. Case study of a learning algorithm for the longest common subsequence problem. In Technical Report TR 98-3 (1998). Computer Science Department, Rensselaer Polytechnic Institute.
5. CHVATAL, V., KLARNER, D. A., AND KNUTH, D. E. 1972. Selected combinatorial research problems. In Technical Report STAN-CS-92 (1972). Computer Science Department, Stanford University.
6. th Annual Symposium on Theoretical Aspects of Computer Science (1994), pp. 669-678.
7. GOLDBERG, M. AND HOLLINGER, D. 1998. Designing algorithms by sampling. In Proceedings of the Workshop on Algorithms and Experiments (ALEX 98) (1998).
8. HIRSCHBERG, D. S. 1975. A linear space algorithm for computing longest common subsequences. Communications of the ACM 18, 341-343.
9. HIRSCHBERG, D. S. 1977. Algorithms for the longest common subsequence problem. Journal of the ACM 24, 664-675.
10. HUNT, J. W. AND SZYMANSKI, T. G. 1977. A fast algorithm for computing longest common subsequences. Communications of the ACM 20, 350-353.
11. JIANG, T. AND LI, M. 1995. On the approximation of shortest common supersequences and longest subsequences. SIAM Journal on Computing 24, 1122-1139.
12. MASEK, W. J. AND PATERSON, M. S. 1980. A faster algorithm for computing string edit distances. Journal of Computer and System Science 20, 18-31.
13. MITCHELL, T. M. 1997. Machine Learning. WCB/McGraw-Hill.
14. MYERS, E. W. 1986. An o(nd) difference algorithm and its variations. Algorithmica 1, 251-266.
15. NAKATSU, N., KAMBAYASHI, Y., AND YAJIMA, S. 1982. A longest common subsequenc algorithm suitable for similar text strings. Acta Informatica 18, 171-179.
16. SANKOFF, D. AND KRUSKAL, J. B. 1983. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Companions. Addison-Wesley, Reading, MA.
17. SMITH, T. F. AND WATERMAN, M. S. 1981. Identification of common molecular subsequences. Journal of Molecular Biology 147, 195-197.
18. UKKONEN, E. 1985. Algorithms for approximate string matching. Information and Control 64, 100-118.
19. VALIANT, L. G. 1984. A theory of the learnable. Communications of the ACM 27, 1134-1142.
20. WAGNER, R. A. AND FISHER, M.J. 1974. The string-to-string correction problem. Journal of the ACM 21, 168-173.
21. WU, S., MANBER, U., MYERS, E., AND MILLER, W. 1990. An o(np) sequence comparison algorithm. Information Processing Letters 35, 317-323.