Unknown

Dataset Information

A comparison of phylogenetic network methods using computer simulation.


ABSTRACT:

Background

We present a series of simulation studies that explore the relative performance of several phylogenetic network approaches (statistical parsimony, split decomposition, union of maximum parsimony trees, neighbor-net, simulated history recombination upper bound, median-joining, reduced median joining and minimum spanning network) compared to standard tree approaches, (neighbor-joining and maximum parsimony) in the presence and absence of recombination.

Principal findings

In the absence of recombination, all methods recovered the correct topology and branch lengths nearly all of the time when the substitution rate was low, except for minimum spanning networks, which did considerably worse. At a higher substitution rate, maximum parsimony and union of maximum parsimon

SUBMITTER: Woolley SM 

PROVIDER: S-EPMC2275308 | biostudies-literature | 2008 Apr

REPOSITORIES: biostudies-literature