scientific article
From MaRDI portal
Publication:3138930
zbMath0785.90095MaRDI QIDQ3138930
Lawrence L. Larmore, Baruch Schieber
Publication date: 13 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39) Biochemistry, molecular biology (92C40)
Related Items
Selection and sorting in totally monotone arrays ⋮ Efficient algorithms for some path partitioning problems ⋮ A linear-time algorithm for concave one-dimensional dynamic programming ⋮ An optimal algorithm with unknown time complexity for convex matrix searching ⋮ Dynamic programming with convexity, concavity and sparsity ⋮ A Lagrangian relaxation approach for the multiple sequence alignment problem ⋮ A branch-and-cut algorithm for multiple sequence alignment
