Rearrangement moves on rooted phylogenetic networks

Phylogenetic tree reconstruction is usually done by local search heuristics that explore the space of the possible tree topologies via simple rearrangements of their structure. Tree rearrangement heuristics have been used in combination with practically all optimization criteria in use, from maximum likelihood and parsimony to distance-based principles, and in a Bayesian context. Their basic components are rearrangement moves that specify all possible ways of generating alternative phylogenies from a given one, and whose fundamental property is to be able to transform, by repeated application, any phylogeny into any other phylogeny. Despite their long tradition in tree-based phylogenetics, very little research has gone into studying similar rearrangement operations for phylogenetic network—that is, phylogenies explicitly representing scenarios that include reticulate events such as hybridization, horizontal gene transfer, population admixture, and recombination. To fill this gap, we propose “horizontal” moves that ensure that every network of a certain complexity can be reached from any other network of the same complexity, and “vertical” moves that ensure reachability between networks of different complexities. When applied to phylogenetic trees, our horizontal moves—named rNNI and rSPR—reduce to the best-known moves on rooted phylogenetic trees, nearest-neighbor interchange and rooted subtree pruning and regrafting. Besides a number of reachability results—separating the contributions of horizontal and vertical moves—we prove that rNNI moves are local versions of rSPR moves, and provide bounds on the sizes of the rNNI neighborhoods. The paper focuses on the most biologically meaningful versions of phylogenetic networks, where edges are oriented and reticulation events clearly identified. Moreover, our rearrangement moves are robust to the fact that networks with higher complexity usually allow a better fit with the data. Our goal is to provide a solid basis for practical phylogenetic network reconstruction.

[1]  Kunihiko Sadakane,et al.  Computing the Maximum Agreement of Phylogenetic Networks , 2004, CATS.

[2]  Doolittle Wf Phylogenetic Classification and the Universal Tree , 1999 .

[3]  Bernard M. E. Moret,et al.  Phylogenetic Inference , 2011, Encyclopedia of Parallel Computing.

[4]  Yeisoo Yu,et al.  Uncovering the novel characteristics of Asian honey bee, Apis cerana, by whole genome sequencing , 2015, BMC Genomics.

[5]  M. Steel,et al.  Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees , 2001 .

[6]  Yun S. Song,et al.  The Simons Genome Diversity Project: 300 genomes from 142 diverse populations , 2016, Nature.

[7]  L. Boto Horizontal gene transfer in evolution: facts and challenges , 2010, Proceedings of the Royal Society B: Biological Sciences.

[8]  Naren Ramakrishnan,et al.  Problem Solving Handbook in Computational Biology and Bioinformatics , 2010 .

[9]  Luay Nakhleh,et al.  PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships , 2008, BMC Bioinformatics.

[10]  Leo van Iersel,et al.  On Computing the Maximum Parsimony Score of a Phylogenetic Network , 2013, SIAM J. Discret. Math..

[11]  Swapan Mallick,et al.  Ancient Admixture in Human History , 2012, Genetics.

[12]  V. Moulton,et al.  Bounding the Number of Hybridisation Events for a Consistent Evolutionary History , 2005, Journal of mathematical biology.

[13]  D. Huson,et al.  A Survey of Combinatorial Methods for Phylogenetic Networks , 2010, Genome biology and evolution.

[14]  Claudia R. Solís-Lemus,et al.  Inferring Phylogenetic Networks with Maximum Pseudolikelihood under Incomplete Lineage Sorting , 2015, PLoS genetics.

[15]  L. Orgel,et al.  Phylogenetic Classification and the Universal Tree , 1999 .

[16]  J. Hotopp Horizontal gene transfer between bacteria and animals , 2011 .

[17]  Wing-Kin Sung,et al.  Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets , 2004, COCOON.

[18]  R. Sokal,et al.  A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY , 1965 .

[19]  Diethard Tautz,et al.  Understanding the onset of hybrid speciation. , 2010, Trends in genetics : TIG.

[20]  Joseph K. Pickrell,et al.  Inference of Population Splits and Mixtures from Genome-Wide Allele Frequency Data , 2012, PLoS genetics.

[21]  Yun Yu,et al.  A maximum pseudo-likelihood approach for phylogenetic networks , 2015, BMC Genomics.

[22]  Xin He,et al.  On computing the nearest neighbor interchange distance , 1999, Discrete Mathematical Problems with Medical Applications.

[23]  Daniel H. Huson,et al.  Phylogenetic Networks: Contents , 2010 .

[24]  M. L.,et al.  On the Nearest Neighbour Interchange Distance Between Evolutionary Trees , 1996 .

[25]  W. Doolittle,et al.  Lateral gene transfer , 2011, Current Biology.

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

[27]  Daniel H. Huson,et al.  Phylogenetic Networks - Concepts, Algorithms and Applications , 2011 .

[28]  Charles Semple,et al.  On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance , 2005 .

[29]  Derick Wood,et al.  A Note on Some Tree Similarity Measures , 1982, Inf. Process. Lett..

[30]  Sagi Snir,et al.  Maximum likelihood of phylogenetic networks , 2006, Bioinform..

[31]  L. Kubatko Identifying hybridization events in the presence of coalescence via model selection. , 2009, Systematic biology.

[32]  Daniel H. Huson,et al.  Phylogenetic Networks: Introduction to phylogenetic networks , 2010 .

[33]  Simone Linz,et al.  Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations , 2016, Journal of mathematical biology.

[34]  Kevin J. Liu,et al.  Maximum likelihood inference of reticulate evolutionary histories , 2014, Proceedings of the National Academy of Sciences.

[35]  O. Gascuel,et al.  New algorithms and methods to estimate maximum-likelihood phylogenies: assessing the performance of PhyML 3.0. , 2010, Systematic biology.

[36]  Sebastian Bonhoeffer,et al.  Contribution of recombination to the evolutionary history of HIV. , 2015, Current opinion in HIV and AIDS.

[37]  Matthew D. Rasmussen,et al.  Genome-Wide Inference of Ancestral Recombination Graphs , 2013, PLoS genetics.

[38]  Steven Kelk,et al.  Networks: expanding evolutionary thinking. , 2013, Trends in genetics : TIG.

[39]  Céline Scornavacca,et al.  Reconstructible Phylogenetic Networks: Do Not Distinguish the Indistinguishable , 2015, PLoS Comput. Biol..

[40]  K. Crandall,et al.  Recombination in evolutionary genomics. , 2002, Annual review of genetics.

[41]  J. Mallet Hybrid speciation , 2007, Nature.

[42]  Vincent Moulton,et al.  Transforming phylogenetic networks: Moving beyond tree space. , 2016, Journal of theoretical biology.

[43]  J. Degnan,et al.  Displayed Trees Do Not Determine Distinguishability Under the Network Multispecies Coalescent. , 2016, Systematic biology.

[44]  L. Nakhleh Evolutionary Phylogenetic Networks: Models and Issues , 2010 .

[45]  Luay Nakhleh,et al.  Inference of reticulate evolutionary histories by maximum likelihood: the performance of information criteria , 2012, BMC Bioinformatics.

[46]  Alexandros Stamatakis,et al.  RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies , 2014, Bioinform..

[47]  Julie C. Dunning Hotopp,et al.  Horizontal gene transfer between bacteria and animals. , 2011, Trends in genetics : TIG.

[48]  T. Tuller,et al.  Inferring phylogenetic networks by the maximum parsimony criterion: a case study. , 2006, Molecular biology and evolution.

[49]  U. Dieckmann,et al.  Hybridization and speciation , 2013, Journal of evolutionary biology.

[50]  D. Robinson Comparison of labeled trees with valency three , 1971 .