An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree
DOI10.1016/S0020-0190(97)00109-9zbMATH Open1337.92155OpenAlexW2023428264MaRDI QIDQ290256FDOQ290256
Authors: B. Y. Wu, C. Y. Tang 
Publication date: 1 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00109-9
Recommendations
- A combinatorial description of the closest tree algorithm for finding evolutionary trees
- scientific article; zbMATH DE number 2079368
- Selecting the branches for an evolutionary tree.
- Efficient algorithms for inferring evolutionary trees
- Aligning sequences via an evolutionary tree: complexity and approximation
- An algorithm for the maximum likelihood problem on evolutionary trees
- Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
- A robust model for finding optimal evolutionary tree
- scientific article; zbMATH DE number 1956215
- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
Problems related to evolution (92D15) Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Computational complexity of inferring phylogenies from dissimilarity matrices
- A fast algorithm for constructing trees from distance matrices
- A robust model for finding optimal evolutionary tree
- The computational complexity of inferring rooted phylogenies by parsimony
- The complexity of ultrametric partitions on graphs
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290256)
