Aligning sequences via an evolutionary tree

DOI10.1145/195058.195454zbMath1345.92106OpenAlexW2092583980MaRDI QIDQ2817672

Lusheng Wang, Tao Jiang, Eugene L. Lawler

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195454

Mathematics Subject Classification ID

Problems related to evolution (92D15) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)

Related Items (8)

Parametric multiple sequence alignment and phylogeny construction ⋮ On the low-dimensional Steiner minimum tree problem in Hamming metric ⋮ Approximation algorithms for multiple sequence alignment ⋮ A few logs suffice to build (almost) all trees. II ⋮ Approximation algorithms for constrained generalized tree alignment problem ⋮ On the approximability of the Steiner tree problem in phylogeny ⋮ On approximating planar metrics by tree metrics. ⋮ Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions

This page was built for publication: Aligning sequences via an evolutionary tree