Who is Who in Phylogenetic Networks

Publication no #2004   Type :   Html | Bib | Both

Created: 2010-04-21 13:27:01     Modified: 2014-08-19 20:14:40

2004 Yufeng Wu and Jiayin Wang. Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees. In ISBRA10, Vol. 6053:203-214 of LNCS, springer, 2010. Keywords: agreement forest, explicit network, from rooted trees, hybridization, integer linear programming, minimum number, phylogenetic network, phylogeny, Program HybridNumber, Program SPRDist, SPR distance. Note: http://www.engr.uconn.edu/~ywu/Papers/ISBRA10WuWang.pdf.         Toggle abstract "Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridization number, needed in the evolutionary history of two phylogenetic trees. This problem is known to be NP-hard. In this paper, we present a new practical method to compute the exact hybridization number. Our approach is based on an integer linear programming formulation. Simulation results on biological and simulated datasets show that our method (as implemented in program SPRDist) is more efficient and robust than an existing method. © 2010 Springer-Verlag Berlin Heidelberg." @InProceedings{WuWang2010,       AUTHOR = {Wu, Yufeng and Wang, Jiayin},       TITLE = {Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees},       YEAR = {2010},       BOOKTITLE = {ISBRA10},       VOLUME = {6053},       PAGES = {203-214},       SERIES = {LNCS},       PUBLISHER = {springer},       URL = {http://dx.doi.org/10.1007/978-3-642-13078-6_23},       NOTE = {http://www.engr.uconn.edu/~ywu/Papers/ISBRA10WuWang.pdf},       KEYWORDS = {agreement forest, explicit network, from rooted trees, hybridization, integer linear programming, minimum number, phylogenetic network, phylogeny, Program HybridNumber, Program SPRDist, SPR distance} }