Cargando…

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Gambette, Philippe, van Iersel, Leo, Jones, Mark, Lafond, Manuel, Pardi, Fabio, Scornavacca, Celine
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5557604/
https://www.ncbi.nlm.nih.gov/pubmed/28763439
http://dx.doi.org/10.1371/journal.pcbi.1005611
_version_ 1783257241524109312
author Gambette, Philippe
van Iersel, Leo
Jones, Mark
Lafond, Manuel
Pardi, Fabio
Scornavacca, Celine
author_facet Gambette, Philippe
van Iersel, Leo
Jones, Mark
Lafond, Manuel
Pardi, Fabio
Scornavacca, Celine
author_sort Gambette, Philippe
collection PubMed
description 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.
format Online
Article
Text
id pubmed-5557604
institution National Center for Biotechnology Information
language English
publishDate 2017
publisher Public Library of Science
record_format MEDLINE/PubMed
spelling pubmed-55576042017-08-25 Rearrangement moves on rooted phylogenetic networks Gambette, Philippe van Iersel, Leo Jones, Mark Lafond, Manuel Pardi, Fabio Scornavacca, Celine PLoS Comput Biol Research Article 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. Public Library of Science 2017-08-01 /pmc/articles/PMC5557604/ /pubmed/28763439 http://dx.doi.org/10.1371/journal.pcbi.1005611 Text en © 2017 Gambette et al http://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
spellingShingle Research Article
Gambette, Philippe
van Iersel, Leo
Jones, Mark
Lafond, Manuel
Pardi, Fabio
Scornavacca, Celine
Rearrangement moves on rooted phylogenetic networks
title Rearrangement moves on rooted phylogenetic networks
title_full Rearrangement moves on rooted phylogenetic networks
title_fullStr Rearrangement moves on rooted phylogenetic networks
title_full_unstemmed Rearrangement moves on rooted phylogenetic networks
title_short Rearrangement moves on rooted phylogenetic networks
title_sort rearrangement moves on rooted phylogenetic networks
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5557604/
https://www.ncbi.nlm.nih.gov/pubmed/28763439
http://dx.doi.org/10.1371/journal.pcbi.1005611
work_keys_str_mv AT gambettephilippe rearrangementmovesonrootedphylogeneticnetworks
AT vanierselleo rearrangementmovesonrootedphylogeneticnetworks
AT jonesmark rearrangementmovesonrootedphylogeneticnetworks
AT lafondmanuel rearrangementmovesonrootedphylogeneticnetworks
AT pardifabio rearrangementmovesonrootedphylogeneticnetworks
AT scornavaccaceline rearrangementmovesonrootedphylogeneticnetworks