Speeding up Dynamic Programming Algorithms for Finding Optimal Lattice Paths

DOI10.1137/0149094zbMath0689.49030OpenAlexW2027648973MaRDI QIDQ3031523

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

sequence alignmentlattice graphDynamic programming algorithmsoptimal lattice path

Mathematics Subject Classification ID

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

Related Items (1)

Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases

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