Cargando…

BBCA: Improving the scalability of *BEAST using random binning

BACKGROUND: Species tree estimation can be challenging in the presence of gene tree conflict due to incomplete lineage sorting (ILS), which can occur when the time between speciation events is short relative to the population size. Of the many methods that have been developed to estimate species tre...

Descripción completa

Detalles Bibliográficos
Autores principales: Zimmermann, Théo, Mirarab, Siavash, Warnow, Tandy
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2014
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4239591/
https://www.ncbi.nlm.nih.gov/pubmed/25572469
http://dx.doi.org/10.1186/1471-2164-15-S6-S11
_version_ 1782345615976431616
author Zimmermann, Théo
Mirarab, Siavash
Warnow, Tandy
author_facet Zimmermann, Théo
Mirarab, Siavash
Warnow, Tandy
author_sort Zimmermann, Théo
collection PubMed
description BACKGROUND: Species tree estimation can be challenging in the presence of gene tree conflict due to incomplete lineage sorting (ILS), which can occur when the time between speciation events is short relative to the population size. Of the many methods that have been developed to estimate species trees in the presence of ILS, *BEAST, a Bayesian method that co-estimates the species tree and gene trees given sequence alignments on multiple loci, has generally been shown to have the best accuracy. However, *BEAST is extremely computationally intensive so that it cannot be used with large numbers of loci; hence, *BEAST is not suitable for genome-scale analyses. RESULTS: We present BBCA (boosted binned coalescent-based analysis), a method that can be used with *BEAST (and other such co-estimation methods) to improve scalability. BBCA partitions the loci randomly into subsets, uses *BEAST on each subset to co-estimate the gene trees and species tree for the subset, and then combines the newly estimated gene trees together using MP-EST, a popular coalescent-based summary method. We compare time-restricted versions of BBCA and *BEAST on simulated datasets, and show that BBCA is at least as accurate as *BEAST, and achieves better convergence rates for large numbers of loci. CONCLUSIONS: Phylogenomic analysis using *BEAST is currently limited to datasets with a small number of loci, and analyses with even just 100 loci can be computationally challenging. BBCA uses a very simple divide-and-conquer approach that makes it possible to use *BEAST on datasets containing hundreds of loci. This study shows that BBCA provides excellent accuracy and is highly scalable.
format Online
Article
Text
id pubmed-4239591
institution National Center for Biotechnology Information
language English
publishDate 2014
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-42395912014-11-25 BBCA: Improving the scalability of *BEAST using random binning Zimmermann, Théo Mirarab, Siavash Warnow, Tandy BMC Genomics Research BACKGROUND: Species tree estimation can be challenging in the presence of gene tree conflict due to incomplete lineage sorting (ILS), which can occur when the time between speciation events is short relative to the population size. Of the many methods that have been developed to estimate species trees in the presence of ILS, *BEAST, a Bayesian method that co-estimates the species tree and gene trees given sequence alignments on multiple loci, has generally been shown to have the best accuracy. However, *BEAST is extremely computationally intensive so that it cannot be used with large numbers of loci; hence, *BEAST is not suitable for genome-scale analyses. RESULTS: We present BBCA (boosted binned coalescent-based analysis), a method that can be used with *BEAST (and other such co-estimation methods) to improve scalability. BBCA partitions the loci randomly into subsets, uses *BEAST on each subset to co-estimate the gene trees and species tree for the subset, and then combines the newly estimated gene trees together using MP-EST, a popular coalescent-based summary method. We compare time-restricted versions of BBCA and *BEAST on simulated datasets, and show that BBCA is at least as accurate as *BEAST, and achieves better convergence rates for large numbers of loci. CONCLUSIONS: Phylogenomic analysis using *BEAST is currently limited to datasets with a small number of loci, and analyses with even just 100 loci can be computationally challenging. BBCA uses a very simple divide-and-conquer approach that makes it possible to use *BEAST on datasets containing hundreds of loci. This study shows that BBCA provides excellent accuracy and is highly scalable. BioMed Central 2014-10-17 /pmc/articles/PMC4239591/ /pubmed/25572469 http://dx.doi.org/10.1186/1471-2164-15-S6-S11 Text en Copyright © 2014 Zimmermann et al.; licensee BioMed Central Ltd. 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 work is properly cited. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
spellingShingle Research
Zimmermann, Théo
Mirarab, Siavash
Warnow, Tandy
BBCA: Improving the scalability of *BEAST using random binning
title BBCA: Improving the scalability of *BEAST using random binning
title_full BBCA: Improving the scalability of *BEAST using random binning
title_fullStr BBCA: Improving the scalability of *BEAST using random binning
title_full_unstemmed BBCA: Improving the scalability of *BEAST using random binning
title_short BBCA: Improving the scalability of *BEAST using random binning
title_sort bbca: improving the scalability of *beast using random binning
topic Research
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4239591/
https://www.ncbi.nlm.nih.gov/pubmed/25572469
http://dx.doi.org/10.1186/1471-2164-15-S6-S11
work_keys_str_mv AT zimmermanntheo bbcaimprovingthescalabilityofbeastusingrandombinning
AT mirarabsiavash bbcaimprovingthescalabilityofbeastusingrandombinning
AT warnowtandy bbcaimprovingthescalabilityofbeastusingrandombinning