Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
- 262 Downloads
Phylogenetic networks are a generalization of evolutionary or phylogenetic trees that are used to represent the evolution of species which have undergone reticulate evolution. In this paper we consider spaces of such networks defined by some novel local operations that we introduce for converting one phylogenetic network into another. These operations are modeled on the well-studied nearest-neighbor interchange operations on phylogenetic trees, and lead to natural generalizations of the tree spaces that have been previously associated to such operations. We present several results on spaces of some relatively simple networks, called level-1 networks, including the size of the neighborhood of a fixed network, and bounds on the diameter of the metric defined by taking the smallest number of operations required to convert one network into another. We expect that our results will be useful in the development of methods for systematically searching for optimal phylogenetic networks using, for example, likelihood and Bayesian approaches.
KeywordsPhylogenetic networks Spaces of phylogenetic trees Phylogenetic tree metrics Nearest-neighbor interchange (NNI)
Mathematics Subject Classification05C90 92D15
The authors thank the organizers of the workshop “Utilizing Genealogical Phylogenetic Networks in Evolutionary Biology: Touching the Data” at the Lorentz Center (the Netherlands) where the ideas for this paper were first discussed. We also thank the anonymous referee for very careful reading and helpful suggestions on the first version of this manuscript.
- DasGupta B, He X, Jiang T, Li M, Tromp J, Zhang L (1997) On distances between phylogenetic trees. In: Proceedings of the eighth annual ACM-SIAM symposium on discrete algorithms. Society for industrial and applied mathematics, pp 427–436Google Scholar
- Gambette P, Berry V, Paul C (2009) The structure of level-k phylogenetic networks. In: Proceedings of combinatorial pattern matching. Springer, New York, pp 289–300Google Scholar
- Gambette P, Berry V, Paul C (2012) Quartets and unrooted phylogenetic networks. J Bioinform Comput Biol 10:04Google Scholar
- Gusfield D (2014) ReCombinatorics: the algorithmics of ancestral recombination graphs and explicit phylogenetic networks. MIT Press, New YorkGoogle Scholar
- Lemey P, Salemi M, Vandamme AM (2009) The phylogenetic handbook: a practical approach to phylogenetic analysis and hypothesis testing. Cambridge University Press, CambridgeGoogle Scholar
- Radice R (2011) A Bayesian approach to phylogenetic networks. PhD thesis, University of BathGoogle Scholar
- Semple C, Steel M (2003) Phylogenetics. Oxford University Press, OxfordGoogle Scholar
- Swofford DL, Olsen GJ, Waddell PJ, Hillis DM (1996) Phylogenetic inference. In: Hillis DM, Moritz C, Mable BK (eds) Molecular systematics, 2nd edn. Sinauer Associates, Inc, Sunderland, Massachusetts, USA, pp 407–514Google Scholar
- Yu Y, Dong J, Liu KJ, Nakhleh L (2014) Maximum likelihood inference of reticulate evolutionary histories. Proc Natl Acad Sci 111(46):16448–16453Google Scholar