Trees, Stars, and Multiple Biological Sequence Alignment
From MaRDI portal
Publication:3471898
DOI10.1137/0149012zbMath0695.92006WikidataQ113779254 ScholiaQ113779254MaRDI QIDQ3471898
David J. Lipman, Stephen F. Altschul
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/0149012
protein sequences; molecular biology; nucleic acid sequences; tree topologies; branch and bound inequalities; Carrillo-Lipman inequality; cost of an evolutionary tree; multiple alignment cost; optimal multiple sequence alignment; star topologies
90C05: Linear programming
90C39: Dynamic programming
92Cxx: Physiological, cellular and medical topics
Related Items
A survey of multiple sequence comparison methods, Efficient methods for multiple sequence alignment with guaranteed error bounds, A multiple sequence comparison method, Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree, On computing all suboptimal alignments, The computation of consensus patterns in \(DNA\) sequences, Multiple sequence comparison -- a peptide matching approach, Approximation algorithms for multiple sequence alignment, Fixed topology alignment with recombination, A measure of discrepancy of multiple sequences, Comparison of strings belonging to the same family, Approximation algorithms for tree alignment with a given phylogeny
