An Ultrafast Tool for Minimum Reticulate Networks
- 1 January 2013
- journal article
- research article
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 20 (1) , 38-41
Abstract
Due to hybridization events in evolution, studying different genes of a set of species may yield two or more related but different phylogenetic trees for the set of species. In this case, we want to combine the trees into a reticulate network with the fewest hybridization events. In this article, we develop a software tool (named UltraNet ) for several fundamental problems related to the construction of minimum reticulate networks from two or more phylogenetic trees. Our experimental results show that UltraNet is much faster than all previous tools for these problems.Keywords
This publication has 10 references indexed in Scilit:
- A fast tool for minimum hybridization networksBMC Bioinformatics, 2012
- Fast computation of minimum hybridization networksBioinformatics, 2011
- Algorithms for Reticulate Networks of Multiple Phylogenetic TreesIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2011
- Quantifying Hybridization in Realistic TimeJournal of Computational Biology, 2011
- Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic treesBioinformatics, 2010
- A practical method for exact computation of subtree prune and regraft distanceBioinformatics, 2008
- Phylogenetic identification of lateral genetic transfer eventsBMC Ecology and Evolution, 2006
- Bounding the Number of Hybridisation Events for a Consistent Evolutionary HistoryJournal of Mathematical Biology, 2005
- On the Computational Complexity of the Rooted Subtree Prune and Regraft DistanceAnnals of Combinatorics, 2005
- On the complexity of comparing evolutionary treesDiscrete Applied Mathematics, 1996