Computing the Maximum Agreement of Phylogenetic Networks

We introduce the maximum agreement phylogenetic subnetwork problem (MASN) of finding a 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 contains at most f nodes having indegree 2 in N. Our algorithm can be extended to yield a polynomial-time algorithm for two level-f phylogenetic networks N1,N2 for any f which is upper-bounded by a constant; more precisely, its running time is O(|V(N1)|·|V(N2)|·4f), where V(Ni) denotes the set of nodes of Ni.

[1]  Ralph Grishman,et al.  Alignment of Shared Forests for Bilingual Corpora , 1996, COLING.

[2]  Dan Gusfield,et al.  Efficient reconstruction of phylogenetic networks with constrained recombination , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[3]  J. Hein.  Reconstructing evolution of sequences subject to recombination using parsimony. , 1990, Mathematical biosciences.

[4]  Amihood Amir,et al.  Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms , 1997, SIAM J. Comput..

[5]  Kaizhong Zhang,et al.  Perfect Phylogenetic Networks with Recombination , 2001, J. Comput. Biol..

[6]  Mikkel Thorup,et al.  An O(n log n) algorithm for the maximum agreement subtree problem for binary trees , 1996, SODA '96.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Ming-Yang Kao,et al.  An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings , 2001, J. Algorithms.

[9]  Ming-Yang Kao.  Tree Contractions and Evolutionary Trees , 1998, SIAM J. Comput..

[10]  Mikkel Thorup,et al.  On the Agreement of Many Trees , 1995, Inf. Process. Lett..

[11]  Hing-Fung Ting,et al.  An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees , 2006, Inf. Process. Lett..

[12]  João Meidanis,et al.  Introduction to computational molecular biology , 1997 .

[13]  Mikkel Thorup,et al.  Sparse Dynamic Programming for Evolutionary-Tree Comparison , 1997, SIAM J. Comput..

[14]  Bin Ma,et al.  Chain letters & evolutionary histories. , 2003, Scientific American.

[15]  Tandy J. Warnow,et al.  Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree , 1993, Inf. Process. Lett..

[16]  A. D. Gordon,et al.  Obtaining common pruned trees , 1985 .

[17]  D. Bryant.  Building trees, hunting for trees, and comparing trees : theory and methods in phylogenetic analysis , 1997 .

[18]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[19]  V. Moulton,et al.  Neighbor-net: an agglomerative method for the construction of phylogenetic networks. , 2002, Molecular biology and evolution.

[20]  K. Crandall,et al.  Intraspecific gene genealogies: trees grafting into networks. , 2001, Trends in ecology & evolution.