scientific article; zbMATH DE number 432797
From MaRDI portal
Publication:3138930
zbMATH Open0785.90095MaRDI QIDQ3138930FDOQ3138930
Authors: Lawrence L. Larmore, Baruch Schieber
Publication date: 13 April 1994
Title of this publication is not available (Why is that?)
Recommendations
Biochemistry, molecular biology (92C40) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (9)
- A linear-time algorithm for concave one-dimensional dynamic programming
- Title not available (Why is that?)
- An optimal algorithm with unknown time complexity for convex matrix searching
- Efficient algorithms for some path partitioning problems
- 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
- Rapid dynamic programming algorithms for RNA secondary structure
- Selection and sorting in totally monotone arrays
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138930)