TY - GEN
T1 - Parsimony is hard to beat!
AU - Rice, Kenneth
AU - Warnow, Tandy
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.
PY - 1997
Y1 - 1997
N2 - The estimation of evolutionary history from biomolecular sequences is a major intellectual project in systematic biology and many methods are used to reconstruct phylogenetic (i.e. evolutionary) trees from sequence data. In this paper, we report on an extensive performance analysis of parsimony and two distance-based methods, a popular method called neighbor joining, and a new method developed by Agarwala et al. which approximates the L ∞-nearest tree, on more than 260,000 sequence data sets simulated on approximately 500 model trees. Our experiments indicate a decrease in statistical power of the two distance methods as the diameter grows, but also show that parsimony is not as badly affected by the diameter as the distance methods. More generally, the experiments indicate that parsimony is almost always more accurate than the other two methods on reasonable length sequences even under adverse conditions, such as having sites that evolve quickly within the tree, pairs of taxa with large evolutionary distances between them, or large ratios between the highest and the lowest substitution rates on the edges.
AB - The estimation of evolutionary history from biomolecular sequences is a major intellectual project in systematic biology and many methods are used to reconstruct phylogenetic (i.e. evolutionary) trees from sequence data. In this paper, we report on an extensive performance analysis of parsimony and two distance-based methods, a popular method called neighbor joining, and a new method developed by Agarwala et al. which approximates the L ∞-nearest tree, on more than 260,000 sequence data sets simulated on approximately 500 model trees. Our experiments indicate a decrease in statistical power of the two distance methods as the diameter grows, but also show that parsimony is not as badly affected by the diameter as the distance methods. More generally, the experiments indicate that parsimony is almost always more accurate than the other two methods on reasonable length sequences even under adverse conditions, such as having sites that evolve quickly within the tree, pairs of taxa with large evolutionary distances between them, or large ratios between the highest and the lowest substitution rates on the edges.
UR - http://www.scopus.com/inward/record.url?scp=84947793322&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84947793322&partnerID=8YFLogxK
U2 - 10.1007/bfb0045079
DO - 10.1007/bfb0045079
M3 - Conference contribution
AN - SCOPUS:84947793322
SN - 354063357X
SN - 9783540633570
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 124
EP - 133
BT - Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings
A2 - Jiang, Tao
A2 - Lee, D.T.
PB - Springer
T2 - 3rd Annual International Computing and Combinatorics Conference, COCOON 1997
Y2 - 20 August 1997 through 22 August 1997
ER -