Who is Who in Phylogenetic Networks

Publication no #2230   Type :   Html | Bib | Both

Created: 2012-07-18 16:01:23     Modified: 2013-01-06 11:29:51

2230 Ruogu Sheng and Sergey Bereg. Approximating Metrics with Planar Boundary-Labeled Phylogenetic Networks. In JBCB, Vol. 10(6):1250017, 2012. Keywords: abstract network, from distances, phylogenetic network, phylogeny, reconstruction.         Toggle abstract "Phylogenetic networks are useful for visualizing evolutionary relationships between species with reticulate events such as hybridizations and horizontal gene transfers. In this paper, we consider the problem of constructing undirected phylogenetic networks that (1) are planar graphs and (2) admit embeddings in the plane where the vertices labeling all taxa are on the boundary of the network. We develop a new algorithm for constructing phylogenetic networks satisfying these constraints. First, we show that only approximate networks can be constructed for some distance matrices with at least five taxa. Then we prove that any five-point metric can be represented approximately by a planar boundary-labeled network with guaranteed fit value of 94.79. We extend the networks constructed in the proof to design an algorithm for computing planar boundary-labeled networks for any number of taxa. © 2012 Imperial College Press." @Article{ShengBereg2012,       AUTHOR = {Sheng, Ruogu and Bereg, Sergey},       TITLE = {Approximating Metrics with Planar Boundary-Labeled Phylogenetic Networks},       YEAR = {2012},       JOURNAL = {JBCB},       VOLUME = {10},       NUMBER = {6},       PAGES = {1250017},       URL = {http://dx.doi.org/10.1142/S0219720012500175},       KEYWORDS = {abstract network, from distances, phylogenetic network, phylogeny, reconstruction} }