The following pages link to (Q3138930):
Displaying 7 items.
- A linear-time algorithm for concave one-dimensional dynamic programming (Q909460) (← links)
- An optimal algorithm with unknown time complexity for convex matrix searching (Q917275) (← links)
- A Lagrangian relaxation approach for the multiple sequence alignment problem (Q1016042) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Efficient algorithms for some path partitioning problems (Q1900138) (← links)
- A branch-and-cut algorithm for multiple sequence alignment (Q2583133) (← links)
- Selection and sorting in totally monotone arrays (Q3979609) (← links)
