Pages that link to "Item:Q3493226"
From MaRDI portal
The following pages link to Sequence comparison with mixed convex and concave costs (Q3493226):
Displayed 18 items.
- A linear-time algorithm for concave one-dimensional dynamic programming (Q909460) (← links)
- Minimum \(L_k\) path partitioning-an illustration of the Monge property (Q924884) (← links)
- A Lagrangian relaxation approach for the multiple sequence alignment problem (Q1016042) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- Structured \(p\)-facility location problems on the line solvable in polynomial time (Q1382805) (← links)
- Consecutive interval query and dynamic programming on intervals (Q1392542) (← links)
- Monge strikes again: Optimal placement of web proxies in the internet (Q1593707) (← links)
- A faster off-line algorithm for the TCP acknowledgement problem. (Q1603523) (← links)
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008) (← links)
- Approximate regular expression pattern matching with concave gap penalties (Q1894715) (← links)
- Efficient algorithms for some path partitioning problems (Q1900138) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Finding least-weight subsequences with fewer processors (Q2366242) (← links)
- A branch-and-cut algorithm for multiple sequence alignment (Q2583133) (← links)
- Selection and sorting in totally monotone arrays (Q3979609) (← links)