Who is Who in Phylogenetic Networks

Publication no #642   Type :   Html | Bib | Both

Created: 2008-06-06 15:55:36     Modified: 2008-11-01 14:32:13

642 Lichen Bao and Sergey Bereg. Clustered SplitsNetworks. In COCOA08, Vol. 5165:469-478 of LNCS, springer, 2008. Keywords: abstract network, from distances, NeighborNet, realization, reconstruction. Note: http://dx.doi.org/10.1007/978-3-540-85097-7_44, slides available at http://www.utdallas.edu/~besp/cocoa08talk.pdf.         Toggle abstract "We address the problem of constructing phylogenetic networks using two criteria: the number of cycles and the fit value of the network. Traditionally the fit value is the main objective for evaluating phylogenetic networks. However, a small number of cycles in a network is desired and pointed out in several publications. We propose a new phylogenetic network called CS-network and a method for constructing it. The method is based on the well-known splitstree method. A CS-network contains a face which is k-cycle, k ≥ 3 (not as splitstree). We discuss difficulties of using non-parallelogram faces in splitstree networks. Our method involves clustering and optimization of weights of the network edges. The algorithm for constructing the underlying graph (except the optimization step) has a polynomial time. Experimental results show a good performance of our algorithm. © Springer-Verlag Berlin Heidelberg 2008." @InProceedings{BaoBereg2008,       AUTHOR = {Bao, Lichen and Bereg, Sergey},       TITLE = {Clustered SplitsNetworks},       YEAR = {2008},       BOOKTITLE = {COCOA08},       VOLUME = {5165},       PAGES = {469-478},       SERIES = {LNCS},       PUBLISHER = {springer},       URL = {http://dx.doi.org/10.1007/978-3-540-85097-7_44},       NOTE = {http://dx.doi.org/10.1007/978-3-540-85097-7_44, slides available at http://www.utdallas.edu/~besp/cocoa08talk.pdf},       ANNOTE = {BIBUPDATE : 20080606},       KEYWORDS = {abstract network, from distances, NeighborNet, realization, reconstruction} }