Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme
References (21)
Inferring phytogenies from dissimilarity matrices
Bull. Math. Biol.
(1987)- et al.
A polynomial–time algorithm for the perfect phylogeny problem when the number of character states is fixed
SIAM J. Comput.
(1994) - et al.
Proof verification and hardness of approximation problems
- et al.
Trees and Proximity Representations
(1991) - et al.
Inferring evolutionary trees with strong combinatorial evidence
- et al.
A practical algorithm for recovering the best supported edges of an evolutionary tree
- et al.
Constructing big trees from short sequences
- et al.
When are two qualitative taxonomic characters compatible?
J. Math. Biol.
(1977) Evolutionary trees from DNA sequences: A maximum likelihood approach
J. Mol. Evol.
(1981)Toward defining the course of evolution: Minimal change for a specific tree topology
Syst. Zool.
(1971)
There are more references available in the full text version of this article.
Cited by (2)
Bad clade deletion supertrees: A fast and accurate supertree algorithm
2017, Molecular Biology and EvolutionTriangulation heuristics for maximum character compatibility
2013, 2013 IEEE 3rd International Conference on Computational Advances in Bio and Medical Sciences, ICCABS 2013
- 1
Supported by CITO.
- 2
Supported by CITO and NSERC grant 160321.
- 3
Supported by CITO, NSERC grant OGP0046506, CGAT and a Steacie Fellowship.
- 4
Supported by NSERC.
- 5
Supported by NSERC Research Grant OGP0046613, CITO and a UCR startup grant.
Copyright © 2003 Elsevier Inc. All rights reserved.