Who is Who in Phylogenetic Networks

Publication no #390   Type :   Html | Bib | Both

Created: 2007-11-17 01:16:40     Modified: 2008-12-02 10:34:40

390 Sergey Bereg and Kathryn Bean. Constructing Phylogenetic Networks from Trees. In BIBE05, Pages 299-305, 2005. Keywords: evaluation, from distances, phylogenetic network, phylogeny, Program SplitsTree, Program T REX, reconstruction, split, split network. Note: http://dx.doi.org/10.1109/BIBE.2005.19.         Toggle abstract We present a new method of constructing a phylogenetic network from a given phylogenetic tree. It is based on a procedure that locally improves the tree. The procedure is quite general and can be applied to phylogenetic networks. By repeating local improvements user can introduce a given number of recombination cycles. A sequence of networks with decreasing distance deviation can be generated. The algorithm is efficient and shows a good performance on an example with plants. This is due to the fact that the update in every step is local and optimal. © 2005 IEEE. Comments: 1. Starting from an NJ-tree, to fit the distance matrix better, transform some edges into boxes to get a (planar) split network. Comparison on 1 example with T-Rex and SplitsTree (which method? NeighborNet I guess, see MakarenkovLegendre1999)