Aligning sequences via an evolutionary tree
From MaRDI portal
Publication:2817672
DOI10.1145/195058.195454zbMath1345.92106MaRDI 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
92D15: Problems related to evolution
92C40: Biochemistry, molecular biology
92D20: Protein sequences, DNA sequences
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
92-08: Computational methods for problems pertaining to biology
Related Items
On the low-dimensional Steiner minimum tree problem in Hamming metric, Parametric multiple sequence alignment and phylogeny construction, Approximation algorithms for constrained generalized tree alignment problem, On the approximability of the Steiner tree problem in phylogeny, Approximation algorithms for multiple sequence alignment, On approximating planar metrics by tree metrics., Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions, A few logs suffice to build (almost) all trees. II