Selected papers that cite this one
- David Eppstein, Zvi Galil, Faffaele Giancarlo, and Giuseppe F. Italiano. Sparse dynamic programming I: Linear cost functions. Journal of the ACM, 39(3):519-545, July 1992.
- C. B. Fraser and R. W. Irving. Approximation Algorithms for the Shortest Common Supersequence. Nordic Journal of Computing, 2(3):303-325, Fall 1995.
- Campbell B. Fraser, Robert W. Irving, and Martin Middendorf. Maximal common subsequences and minimal common supersequences. Information and Computation, 124(2):145-153, 1 February 1996.
- Gad M. Landau, Eugene W. Myers, and Jeanette P. Schmidt. Incremental string comparison. SIAM Journal on Computing, 27(2):557-582, March 1998.
- C. Rick. A New Flexible Algorithm for the Longest Common Subsequence Problem. Nordic Journal of Computing, 2(4):444-461, Winter 1995.