Sparse dynamic programming
David Eppstein,
Zvi Galil,
Raffaele Giancarlo,
and Giuseppe F. Italiano
Proc. 1st Symp. Discrete Algorithms, ACM
and SIAM, Jan 1990, pp. 513–522
Cited by:
- On-line dynamic programming with applications to the prediction of RNA secondary structure
- Finding least-weight subsequences with fewer processors
- An $O(n^2\log n)$ restriction map comparison and search algorithm
- Aligning two sequences within a specified diagonal band
- Constrained sequence alignment
- Matrix longest common subsequence problem, duality and Hilbert bases
- Generalized sequence alignment and duality
- Data structures and algorithms for disjoint set union problems
- Consecutive interval query and dynamic programming on intervals
- Parallel searching in generalized Monge arrays with applications
- Superlinear bounds for matrix searching problems
- Serial computations of Levenshtein distances
- A Monge property for the $d$-dimensional transportation problem
- An overview of sequence comparison algorithms in molecular biology
