David Eppstein,
Zvi Galil,
Raffaele Giancarlo,
and Giuseppe F. Italiano

*J. ACM* 39(3):546–567, Jul 1992

Tech. report CUCS-472-89, Columbia Univ., Computer Science Dept., 1989

*Mathematical Reviews* 93i:90107b

http://www.acm.org/pubs/citations/journals/jacm/1992-39-3/p546-eppstein/

Cited by:

- On-line dynamic programming with applications to the prediction of RNA secondary structure
- Fast sequential and parallel dynamic programming
- Dynamic programming: special cases
- Linear space algorithms that build local alignments from fragments
- Guest editor's forword to special issue on computational molecular biology
- Chaining multiple-alignment fragments in sub-quadratic time
- Approximate regular expression pattern matching with concave gap penalties
- Dynamic programming with convexity, concavity and sparsity
- Computational molecular biology
- Alignment requirements for NCBI's genomes division
- Chaining multiple-alignment blocks
- A generic program for sequential decision processes
- Computing similarity between RNA strings
- Longest common subsequence from fragments via sparse dynamic programming
- All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings
- The construction of Huffman codes is a submodular (“convex”) optimization problem over a lattice of binary trees
- Bridging the algorithm gap: A linear-time functional program for paragraph formatting
- Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages
- Approximation of staircases by staircases
- A heuristic algorithm for multiple sequence alignment based on blocks
- A sub-quadratic sequence alignment algorithm for unrestricted cost matrices
- Sparse dynamic programming for longest common subsequence from fragments
- LAGAN and Multi-LAGAN: Efficient tools for large-scale multiple alignment of genomic DNA
- L'espoir est cette chose avec des plumes — Algorithmes combinatoires et biologie moléculaire
- A local chaining algorithm and its applications in comparative genomics
- Multiple genome aligment: chaining algorithms revisited
- Dynamic programming as a software component
- Functional Sequence Comparison