Bootstrap-based support of HGT inferred by maximum parsimony.
BACKGROUND
Maximum parsimony is one of the most commonly used criteria for reconstructing phylogenetic trees. Recently, Nakhleh and co-workers extended this criterion to enable reconstruction of phylogenetic networks, and demonstrated its application to detecting reticulate evolutionary relationships. However, one of the major problems with this extension has been that it favors more complex evolutionary relationships over simpler ones, thus having the potential for overestimating the amount of reticulation in the data. An ad hoc solution to this problem that has been used entails inspecting the improvement in the parsimony length as more reticulation events are added to the model, and stopping when the improvement is below a certain threshold.


RESULTS
In this paper, we address this problem in a more systematic way, by proposing a nonparametric bootstrap-based measure of support of inferred reticulation events, and using it to determine the number of those events, as well as their placements. A number of samples is generated from the given sequence alignment, and reticulation events are inferred based on each sample. Finally, the support of each reticulation event is quantified based on the inferences made over all samples.


CONCLUSIONS
We have implemented our method in the NEPAL software tool (available publicly at http://bioinfo.cs.rice.edu/), and studied its performance on both biological and simulated data sets. While our studies show very promising results, they also highlight issues that are inherently challenging when applying the maximum parsimony criterion to detect reticulate evolution.
Park
Hyun Jung
HJ
Department of Computer Science, Rice University, 6100 Main Street, MS 132, Houston, Texas 77005, USA.
Jin
Guohua
G
Nakhleh
Luay
L
D022761:Gene Transfer, Horizontal; D008957:Models, Genetic; D010802:Phylogeny; D010944:Plants / Q000235:genetics*; D012984:Software
Syst Biol. 2010 Mar;59(2):195-211
20525630
IEEE/ACM Trans Comput Biol Bioinform. 2009 Jul-Sep;6(3):495-505
19644176
IEEE/ACM Trans Comput Biol Bioinform. 2004 Jan-Mar;1(1):13-23
17048405
Mol Biol Evol. 2006 Feb;23(2):254-67
16221896
Proc IEEE Comput Syst Bioinform Conf. 2005;:93-102
16447967
Mol Biol Evol. 2007 Jan;24(1):324-37
17068107
Syst Biol. 2007 Aug;56(4):633-42
17661231
Proc Natl Acad Sci U S A. 2004 Dec 21;101(51):17747-52
15598737
Math Biosci. 1990 Mar;98(2):185-200
2134501
Int J Parasitol. 2005 Apr 30;35(5):567-82
15826648
Bioinformatics. 2007 Jan 15;23(2):e123-8
17237079
Bioinformatics. 2006 Nov 1;22(21):2604-11
16928736