1. A. Apostolico and C. Guerra. The longest common subsequence problem revisited. Algorithmica, 2:315–336, 1987.
2. R. A. Baeza-Yates. Searching subsequences. Theoretical Computer Science, 78(2):363–376, January 1991.
3. L. Bergroth, H. Hakonen, and T. Raita. A survey of longest common subsequence algorithms (extended abstract). Technical report, Dept. of Computer Science, University of Turku, Finland, April 2000. manuscript.
4. N. Blum. Speeding up dynamic programming without omitting any optimal solution and some applications in molecular biology. Journal of Algorithms, to appear, 2000.
5. E. Breimer, M. Goldberg, and D. Lim. A learning algorithm for the longest common subsequence problem. In Proceedings of the 2nd Algorithm Engineering and Experiments, pages 147–156, San Francisco, CA, 2000.