Sequence comparison with mixed convex and concave costs
- 1 March 1990
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 11 (1) , 85-101
- https://doi.org/10.1016/0196-6774(90)90031-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Speeding up dynamic programming with applications to molecular biologyTheoretical Computer Science, 1989
- 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
- Rapid dynamic programming algorithms for RNA secondary structureAdvances in Applied Mathematics, 1986
- General methods of sequence comparisonBulletin of Mathematical Biology, 1984
- Breaking paragraphs into linesSoftware: Practice and Experience, 1981
- Parallel Prefix ComputationJournal of the ACM, 1980