Sequence alignments in the neighborhood of the optimum with general application to dynamic programming

DOI10.1073/pnas.80.10.3123zbMath0516.90075OpenAlexW1991599955WikidataQ37612630 ScholiaQ37612630MaRDI QIDQ3664852

Michael S. Waterman

Publication date: 1983

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.80.10.3123

zbMATH Keywords

algorithmdiscrete dynamic programmingsequence alignmentssequence homologyKth best-path problemKth shortest pathssequence distance

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Dynamic programming (90C39) Physiological, cellular and medical topics (92Cxx)

Related Items (6)

Parametric and ensemble sequence alignment algorithms ⋮ Enumerating \(K\) best paths in length order in DAGs ⋮ Two-best solutions under distance constraints: The model and exemplary results for matroids ⋮ General methods of sequence comparison ⋮ RNA secondary structures and their prediction ⋮ A dynamic programming algorithm to find all solutions in a neighborhood of the optimum

This page was built for publication: Sequence alignments in the neighborhood of the optimum with general application to dynamic programming