EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

DaTeR: error-correcting phylogenetic chronograms using relative time constraints

Abhijit Mondal, L Thiberio Rangel, Jack G Payette, Gregory P Fournier, Mukul S Bansal iD

Bioinformatics · 2023

DOI: 10.1093/bioinformatics/btad084 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bioinformatics, 2023. Verfasst von Abhijit Mondal und 4 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269, USA. Hauptthemen laut MEDLINE: Biological Evolution, Fossils. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 28 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Motivation A chronogram is a dated phylogenetic tree whose branch lengths have been scaled to represent time. Such chronograms are computed based on available date estimates (e.g. from dated fossils), which provide absolute time constraints for one or more nodes of an input undated phylogeny, coupled with an appropriate underlying model for evolutionary rates variation along the branches of the phylogeny. However, traditional methods for phylogenetic dating cannot take into account relative time constraints, such as those provided by inferred horizontal transfer events. In many cases, chronograms computed using only absolute time constraints are inconsistent with known relative time constraints. Results In this work, we introduce a new approach, Dating Trees using Relative constraints (DaTeR), for phylogenetic dating that can take into account both absolute and relative time constraints. The key idea is to use existing Bayesian approaches for phylogenetic dating to sample posterior chronograms satisfying desired absolute time constraints, minimally adjust or ‘error-correct’ these sampled chronograms to satisfy all given relative time constraints, and aggregate across all error-corrected chronograms. DaTeR uses a constrained optimization framework for the error-correction step, finding minimal deviations from previously assigned dates or branch lengths. We applied DaTeR to a biological dataset of 170 Cyanobacterial taxa and a reliable set of 24 transfer-based relative constraints, under six different molecular dating models. Our extensive analysis of this dataset demonstrates that DaTeR is both highly effective and scalable and that its application can significantly improve estimated chronograms. Availability and implementation Freely available from https://compbio.engr.uconn.edu/software/dater/ Supplementary information Supplementary data are available at Bioinformatics online.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Biological EvolutionFossilsPhylogenyBayes TheoremTimeEvolution, Molecular

Autor:innen und Institutionen

  • Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269, USA.
  • Department of Earth, Atmospheric and Planetary Sciences, Massachusetts Institute of Technology, Cambridge, MA 02139, USA.
  • Institute for Systems Genomics, University of Connecticut, Storrs, CT 06269, USA.

ORCID-Profile: Mukul S Bansal

Förderung

  • National Science Foundation

Zitieren

APA

Mondal, A., Rangel, L. T., Payette, J. G., Fournier, G. P., & Bansal, M. S. (2023). DaTeR: error-correcting phylogenetic chronograms using relative time constraints. Bioinformatics. https://doi.org/10.1093/bioinformatics/btad084

Vancouver

Mondal A, Rangel LT, Payette JG, Fournier GP, Bansal MS. DaTeR: error-correcting phylogenetic chronograms using relative time constraints. Bioinformatics. 2023. doi:10.1093/bioinformatics/btad084

BibTeX
@article{Mondal2023,
  author = {Mondal, Abhijit and Rangel, L Thiberio and Payette, Jack G and Fournier, Gregory P and Bansal, Mukul S},
  title = {DaTeR: error-correcting phylogenetic chronograms using relative time constraints},
  journal = {Bioinformatics},
  year = {2023},
  doi = {10.1093/bioinformatics/btad084}
}
Kostenlos starten →