Sparse dynamic programming I
- 1 July 1992
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 39 (3) , 519-545
- https://doi.org/10.1145/146637.146650
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Sparse dynamic programming IIJournal of the ACM, 1992
- Speeding up dynamic programming with applications to molecular biologyTheoretical Computer Science, 1989
- The concave least-weight subsequence problem revisitedJournal of Algorithms, 1988
- The longest common subsequence problem revisitedAlgorithmica, 1987
- Rapid and Sensitive Protein Similarity SearchesScience, 1985
- A priority queue in which initialization and queue operations takeO(loglogD) timeTheory of Computing Systems, 1981
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- Some biological sequence metricsAdvances in Mathematics, 1976
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970