Evaluating intraspecific "network" construction methods using simulated sequence data: do existing algorithms outperform the global maximum parsimony approach?
In intraspecific studies, reticulated graphs are valuable tools for visualization, within a single figure, of alternative genealogical pathways among haplotypes. As available software packages implementing the global maximum parsimony (MP) approach only give the possibility to merge resulting topologies into less-resolved consensus trees, MP has often been neglected as an alternative approach to purely algorithmic (i.e., methods defined solely on the basis of an algorithm) "network" construction methods. Here, we propose to search tree space using the MP criterion and present a new algorithm for uniting all equally most parsimonious trees into a single (possibly reticulated) graph. Using simulated sequence data, we compare our method with three purely algorithmic and widely used graph construction approaches (minimum-spanning network, statistical parsimony, and median-joining network). We demonstrate that the combination of MP trees into a single graph provides a good estimate of the true genealogy. Moreover, our analyses indicate that, when internal node haplotypes are not sampled, the median-joining and MP methods provide the best estimate of the true genealogy whereas the minimum-spanning algorithm shows very poor performances.
Cassens
Insa
I
Laboratory of Evolutionary Genetics, Institute of Molecular Biology and Medicine, Université Libre de Bruxelles, rue Jeener et Brachet 12, 6041 Gosselies, Belgium.
Mardulyn
Patrick
P
Milinkovitch
Michel C
MC
D000465:Algorithms; D001483:Base Sequence; D002965:Classification / Q000379:methods*; D003198:Computer Simulation; D003627:Data Interpretation, Statistical; D006239:Haplotypes / Q000235:genetics; D010802:Phylogeny