scientific article; zbMATH DE number 432797

MaRDI QIDQ3138930zbMATH OpenFDO

Authors Lawrence L. Larmore, Baruch Schieber

Publication date 13 April 1994

zbMATH Keywords

on-line problemtwo-dimensional dynamic programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60) Biochemistry, molecular biology (92C40)

Recommendations

• On-line dynamic programming with applications to the prediction of RNA secondary structure
• Rapid dynamic programming algorithms for RNA secondary structure
• scientific article; zbMATH DE number 4116366
• Sparse dynamic programming II
• Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots

Cited in

(11)

• A Lagrangian relaxation approach for the multiple sequence alignment problem
• Rapid dynamic programming algorithms for RNA secondary structure
• Dynamic programming with convexity, concavity and sparsity
• Efficient algorithms for some path partitioning problems
• A branch-and-cut algorithm for multiple sequence alignment
• Algebraic dynamic programming for multiple context-free grammars
• Selection and sorting in totally monotone arrays
• scientific article; zbMATH DE number 7559176 (Why is no real title available?)
• On-line dynamic programming with applications to the prediction of RNA secondary structure
• A linear-time algorithm for concave one-dimensional dynamic programming
• An optimal algorithm with unknown time complexity for convex matrix searching

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)