Who is Who in Phylogenetic Networks

Publications related to 'Program SPRDist' : SPRDist computes the SPR distance between two rooted trees, and will, in a next version, compute the hybridization number of two rooted trees with an Integer Linear Programming method. It can be downloaded at http://www.engr.uconn.edu/~ywu/SPRDist.html   Order by:   Type | Year

Only And Or     related to:

Associated keywords

agreement-forest explicit-network from-rooted-trees hybridization integer-linear-programming minimum-number phylogenetic-network phylogeny Program-HybridNumber Program-SPRDist SPR-distance

InProceedings

1 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."