Dynamic programming with convexity, concavity and sparsity
Open Access
- 1 January 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 92 (1) , 49-76
- https://doi.org/10.1016/0304-3975(92)90135-3
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Sequence comparison with mixed convex and concave costsJournal of Algorithms, 1990
- On an efficient dynamic programming technique of F. F. YaoJournal of Algorithms, 1989
- 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
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- A priority queue in which initialization and queue operations takeO(loglogD) timeTheory of Computing Systems, 1981
- RNA secondary structure: a complete mathematical analysisMathematical Biosciences, 1978
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- General context-free recognition in less than cubic timeJournal of Computer and System Sciences, 1975