Speeding up Dynamic Programming Algorithms for Finding Optimal Lattice Paths

DOI10.1137/0149094MaRDI QIDQ3031523zbMATH OpenOpenAlexFDO

Authors John L. Spouge

Publication date 1989

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0149094

zbMATH Keywords

Dynamic programming algorithmslattice graphoptimal lattice pathsequence alignment

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Discrete approximations in optimal control (49M25) Dynamic programming (90C39)

Recommendations

• The Multiple Sequence Alignment Problem in Biology
• A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
• Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology
• Speeding up dynamic programming with applications to molecular biology
• Dynamic programming as optimal path problem in weighted digraphs

Cited in

(3)

• Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases
• A solution of the minimum-time speed planning problem based on lattice theory
• A^*PA2: up to 19 faster exact global alignment

This page was built for publication: Speeding up Dynamic Programming Algorithms for Finding Optimal Lattice Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3031523)