Cargando…

On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo

For various species, high quality sequences and complete genomes are nowadays available for many individuals. This makes data analysis challenging, as methods need not only to be accurate, but also time efficient given the tremendous amount of data to process. In this article, we introduce an effici...

Descripción completa

Detalles Bibliográficos
Autores principales: Rabier, Charles-Elie, Berry, Vincent, Stoltz, Marnus, Santos, João D., Wang, Wensheng, Glaszmann, Jean-Christophe, Pardi, Fabio, Scornavacca, Celine
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8445492/
https://www.ncbi.nlm.nih.gov/pubmed/34478440
http://dx.doi.org/10.1371/journal.pcbi.1008380
_version_ 1784568672860241920
author Rabier, Charles-Elie
Berry, Vincent
Stoltz, Marnus
Santos, João D.
Wang, Wensheng
Glaszmann, Jean-Christophe
Pardi, Fabio
Scornavacca, Celine
author_facet Rabier, Charles-Elie
Berry, Vincent
Stoltz, Marnus
Santos, João D.
Wang, Wensheng
Glaszmann, Jean-Christophe
Pardi, Fabio
Scornavacca, Celine
author_sort Rabier, Charles-Elie
collection PubMed
description For various species, high quality sequences and complete genomes are nowadays available for many individuals. This makes data analysis challenging, as methods need not only to be accurate, but also time efficient given the tremendous amount of data to process. In this article, we introduce an efficient method to infer the evolutionary history of individuals under the multispecies coalescent model in networks (MSNC). Phylogenetic networks are an extension of phylogenetic trees that can contain reticulate nodes, which allow to model complex biological events such as horizontal gene transfer, hybridization and introgression. We present a novel way to compute the likelihood of biallelic markers sampled along genomes whose evolution involved such events. This likelihood computation is at the heart of a Bayesian network inference method called SnappNet, as it extends the Snapp method inferring evolutionary trees under the multispecies coalescent model, to networks. SnappNet is available as a package of the well-known beast 2 software. Recently, the MCMC_BiMarkers method, implemented in PhyloNet, also extended Snapp to networks. Both methods take biallelic markers as input, rely on the same model of evolution and sample networks in a Bayesian framework, though using different methods for computing priors. However, SnappNet relies on algorithms that are exponentially more time-efficient on non-trivial networks. Using simulations, we compare performances of SnappNet and MCMC_BiMarkers. We show that both methods enjoy similar abilities to recover simple networks, but SnappNet is more accurate than MCMC_BiMarkers on more complex network scenarios. Also, on complex networks, SnappNet is found to be extremely faster than MCMC_BiMarkers in terms of time required for the likelihood computation. We finally illustrate SnappNet performances on a rice data set. SnappNet infers a scenario that is consistent with previous results and provides additional understanding of rice evolution.
format Online
Article
Text
id pubmed-8445492
institution National Center for Biotechnology Information
language English
publishDate 2021
publisher Public Library of Science
record_format MEDLINE/PubMed
spelling pubmed-84454922021-09-17 On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo Rabier, Charles-Elie Berry, Vincent Stoltz, Marnus Santos, João D. Wang, Wensheng Glaszmann, Jean-Christophe Pardi, Fabio Scornavacca, Celine PLoS Comput Biol Research Article For various species, high quality sequences and complete genomes are nowadays available for many individuals. This makes data analysis challenging, as methods need not only to be accurate, but also time efficient given the tremendous amount of data to process. In this article, we introduce an efficient method to infer the evolutionary history of individuals under the multispecies coalescent model in networks (MSNC). Phylogenetic networks are an extension of phylogenetic trees that can contain reticulate nodes, which allow to model complex biological events such as horizontal gene transfer, hybridization and introgression. We present a novel way to compute the likelihood of biallelic markers sampled along genomes whose evolution involved such events. This likelihood computation is at the heart of a Bayesian network inference method called SnappNet, as it extends the Snapp method inferring evolutionary trees under the multispecies coalescent model, to networks. SnappNet is available as a package of the well-known beast 2 software. Recently, the MCMC_BiMarkers method, implemented in PhyloNet, also extended Snapp to networks. Both methods take biallelic markers as input, rely on the same model of evolution and sample networks in a Bayesian framework, though using different methods for computing priors. However, SnappNet relies on algorithms that are exponentially more time-efficient on non-trivial networks. Using simulations, we compare performances of SnappNet and MCMC_BiMarkers. We show that both methods enjoy similar abilities to recover simple networks, but SnappNet is more accurate than MCMC_BiMarkers on more complex network scenarios. Also, on complex networks, SnappNet is found to be extremely faster than MCMC_BiMarkers in terms of time required for the likelihood computation. We finally illustrate SnappNet performances on a rice data set. SnappNet infers a scenario that is consistent with previous results and provides additional understanding of rice evolution. Public Library of Science 2021-09-03 /pmc/articles/PMC8445492/ /pubmed/34478440 http://dx.doi.org/10.1371/journal.pcbi.1008380 Text en © 2021 Rabier et al https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://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
Rabier, Charles-Elie
Berry, Vincent
Stoltz, Marnus
Santos, João D.
Wang, Wensheng
Glaszmann, Jean-Christophe
Pardi, Fabio
Scornavacca, Celine
On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo
title On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo
title_full On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo
title_fullStr On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo
title_full_unstemmed On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo
title_short On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo
title_sort on the inference of complex phylogenetic networks by markov chain monte-carlo
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8445492/
https://www.ncbi.nlm.nih.gov/pubmed/34478440
http://dx.doi.org/10.1371/journal.pcbi.1008380
work_keys_str_mv AT rabiercharleselie ontheinferenceofcomplexphylogeneticnetworksbymarkovchainmontecarlo
AT berryvincent ontheinferenceofcomplexphylogeneticnetworksbymarkovchainmontecarlo
AT stoltzmarnus ontheinferenceofcomplexphylogeneticnetworksbymarkovchainmontecarlo
AT santosjoaod ontheinferenceofcomplexphylogeneticnetworksbymarkovchainmontecarlo
AT wangwensheng ontheinferenceofcomplexphylogeneticnetworksbymarkovchainmontecarlo
AT glaszmannjeanchristophe ontheinferenceofcomplexphylogeneticnetworksbymarkovchainmontecarlo
AT pardifabio ontheinferenceofcomplexphylogeneticnetworksbymarkovchainmontecarlo
AT scornavaccaceline ontheinferenceofcomplexphylogeneticnetworksbymarkovchainmontecarlo