A dynamic programming algorithm to find all solutions in a neighborhood of the optimum

DOI10.1016/0025-5564(85)90096-3zbMath0586.90089OpenAlexW2027490384MaRDI QIDQ1072453

Thomas H. Byers, Michael S. Waterman

Publication date: 1985

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(85)90096-3

zbMATH Keywords

k-th best policiesmatching topological sequencesnear-optimal policies

Mathematics Subject Classification ID

Dynamic programming (90C39) General biology and biomathematics (92B05)

Related Items (6)

General space-efficient sampling algorithm for suboptimal alignment ⋮ Identifying consensus of trees through alignment ⋮ Unnamed Item ⋮ Chance and necessity in evolution: lessons from RNA ⋮ Two-best solutions under distance constraints: The model and exemplary results for matroids ⋮ On computing all suboptimal alignments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• General methods of sequence comparison
• Solutions of the kth best route through a network. A review
• Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
• Onkth Best Policies
• Letter to the Editor—The kth Best Route Through a Network
• A Method for the Solution of the N th Best Path Problem
• Sequence alignments in the neighborhood of the optimum with general application to dynamic programming
• Computational experience with an algorithm for finding the k shortest paths in a network
• Iterative methods for determining the k shortest paths in a network
• Data Structures and Computer Science Techniques in Operations Research
• An Appraisal of Some Shortest-Path Algorithms
• On Elmaghraby's “The Theory of Networks and Management Science”
• CalculatingKth Shortest Paths
• A Note on an Algebra for the k Best Routes in a Network

This page was built for publication: A dynamic programming algorithm to find all solutions in a neighborhood of the optimum