Selected papers that cite this one
- A. Aggarwal, D. Kravets, J. K. Park, and S. Sen. Parallel searching in generalized Monge arrays. Algorithmica, 19(3):291-317, November 1997.
- David Eppstein, Zvi Galil, Faffaele Giancarlo, and Giuseppe F. Italiano. Sparse dynamic programming II: Convex and concave cost functions. Journal of the ACM, 39(3):546-567, July 1992.
- C. Rick. A New Flexible Algorithm for the Longest Common Subsequence Problem. Nordic Journal of Computing, 2(4):444-461, Winter 1995.
- Jeanette P. Schmidt. All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM Journal on Computing, 27(4):972-992, August 1998.
Selected references
- Alok Aggarwal and James Park. Notes on searching in multidimensional monotone arrays (preliminary version). In 29th Annual Symposium on Foundations of Computer Science, pages 497-512, White Plains, New York, 24-26 October 1988. IEEE.
- David Eppstein, Zvi Galil, and Raffaele Giancarlo. Speeding up dynamic programming. In 29th Annual Symposium on Foundations of Computer Science, pages 488-496, White Plains, New York, 24-26 October 1988. IEEE.
- David Eppstein, Zvi Galil, Faffaele Giancarlo, and Giuseppe F. Italiano. Sparse dynamic programming II: Convex and concave cost functions. Journal of the ACM, 39(3):546-567, July 1992.
- Daniel S. Hirschberg. Algorithms for the longest common subsequence problem. Journal of the ACM, 24(4):664-675, October 1977.
- Edward M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, April 1976.
- Peter Weiner. Linear pattern matching algorithms. In 14th Annual Symposium on Switching and Automata Theory, pages 1-11, The University of Iowa, 15-17 October 1973. IEEE.