Who is Who in Phylogenetic Networks

Publication no #416   Type :   Html | Bib | Both

Created: 2007-11-17 01:16:41     Modified: 2011-06-07 19:50:47

416 Charles Choy, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung. Computing the maximum agreement of phylogenetic networks. In TCS, Vol. 335(1):93-107, 2005. Keywords: dynamic programming, FPT, level k phylogenetic network, MASN, NP complete, phylogenetic network, phylogeny. Note: http://www.df.lth.se/~jj/Publications/masn8_TCS2005.pdf.         Toggle abstract "We introduce the maximum agreement phylogenetic subnetwork problem (MASN) for finding branching structure shared by a set of phylogenetic networks. We prove that the problem is NP-hard even if restricted to three phylogenetic networks and give an O(n2)-time algorithm for the special case of two level-1 phylogenetic networks, where n is the number of leaves in the input networks and where N is called a level-f phylogenetic network if every biconnected component in the underlying undirected graph induces a subgraph of N containing at most f nodes with indegree 2. We also show how to extend our technique to yield a polynomial-time algorithm for any two level-f phylogenetic networks N1,N2 satisfying f=O(logn); more precisely, its running time is O(|V(N1)|·|V(N2)|·2f1+f2), where V(Ni) and fi denote the set of nodes in Ni and the level of Ni, respectively, for i∈{1,2}. © 2005 Elsevier B.V. All rights reserved." @Article{CJSS2005,       AUTHOR = {Choy, Charles and Jansson, Jesper and Sadakane, Kunihiko and Sung, Wing-Kin},       TITLE = {Computing the maximum agreement of phylogenetic networks},       YEAR = {2005},       JOURNAL = {TCS},       VOLUME = {335},       NUMBER = {1},       PAGES = {93-107},       URL = {http://dx.doi.org/10.1016/j.tcs.2004.12.012},       NOTE = {http://www.df.lth.se/~jj/Publications/masn8_TCS2005.pdf},       ANNOTE = {CITE : },       KEYWORDS = {dynamic programming, FPT, level k phylogenetic network, MASN, NP complete, phylogenetic network, phylogeny} }