Speeding up dynamic programming with applications to molecular biology
- 1 April 1989
- journal article
- research article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 64 (1), 107-118
- https://doi.org/10.1016/0304-3975(89)90101-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The concave least-weight subsequence problem revisitedJournal of Algorithms, 1988
- Sequence comparison with concave weighting functionsBulletin of Mathematical Biology, 1988
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- The Least Weight Subsequence ProblemSIAM Journal on Computing, 1987
- General methods of sequence comparisonBulletin of Mathematical Biology, 1984
- Optimal sequence alignmentsProceedings of the National Academy of Sciences, 1983
- Speed-Up in Dynamic ProgrammingSIAM Journal on Algebraic Discrete Methods, 1982
- New Stratigraphic Correlation TechniquesThe Journal of Geology, 1980
- Optimum binary search treesActa Informatica, 1971