Who is Who in Phylogenetic Networks

Publication no #2202   Type :   Html | Bib | Both

Created: 2012-03-27 22:36:18     Modified: 2013-01-06 11:35:36

2202 Jesper Jansson and Andrzej Lingas. Computing the rooted triplet distance between galled trees by counting triangles. In CPM12, Vol. 7354:385-398 of LNCS, springer, 2012. Keywords: distance between networks, explicit network, from network, galled tree, phylogenetic network, phylogeny, polynomial, triplet distance. Note: http://www.df.lth.se/~jj/Publications/d_rt_for_Galled_Trees5_CPM_2012.pdf.         Toggle abstract "We consider a generalization of the rooted triplet distance between two phylogenetic trees to two phylogenetic networks. We show that if each of the two given phylogenetic networks is a so-called galled tree with n leaves then the rooted triplet distance can be computed in o(n 2.688) time. Our upper bound is obtained by reducing the problem of computing the rooted triplet distance to that of counting monochromatic and almost- monochromatic triangles in an undirected, edge-colored graph. To count different types of colored triangles in a graph efficiently, we extend an existing technique based on matrix multiplication and obtain several new related results that may be of independent interest. © 2012 Springer-Verlag." @InProceedings{JanssonLingas2012,       AUTHOR = {Jansson, Jesper and Lingas, Andrzej},       TITLE = {Computing the rooted triplet distance between galled trees by counting triangles},       YEAR = {2012},       BOOKTITLE = {CPM12},       VOLUME = {7354},       PAGES = {385-398},       SERIES = {LNCS},       PUBLISHER = {springer},       URL = {http://dx.doi.org/10.1007/978-3-642-31265-6_31},       NOTE = {http://www.df.lth.se/~jj/Publications/d_rt_for_Galled_Trees5_CPM_2012.pdf},       KEYWORDS = {distance between networks, explicit network, from network, galled tree, phylogenetic network, phylogeny, polynomial, triplet distance} }