Rapid dynamic programming algorithms for RNA secondary structure
Advances in Applied Mathematics
The least weight subsequence problem
SIAM Journal on Computing
The concave least-weight subsequence problem revisited
Journal of Algorithms
Sequence comparison with mixed convex and concave costs
Journal of Algorithms
Efficient dynamic programming using quadrangle inequalities
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming
A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming
Parallel searching in generalized Monge arrays with applications
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
ACM Transactions on Algorithms (TALG)
A lagrangian relaxation approach for the multiple sequence alignment problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Approximate dynamic programming using halfspace queries and multiscale Monge decomposition
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |