EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Contingency, repeatability, and predictability in the evolution of a prokaryotic pangenome

Alan J S Beavan iD, Maria Rosa Domingo-Sananes iD, James O McInerney iD

Proceedings of the National Academy of Sciences · 02.01.2024 · 121 (1)

DOI: 10.1073/pnas.2304934120 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the National Academy of Sciences, online erschienen am 26.12.2023. Verfasst von Alan J S Beavan und 2 weiteren Autor:innen. Beteiligte Einrichtung: School of Life Sciences, The University of Nottingham, Nottingham NG7 2UH, United Kingdom. Hauptthemen laut MEDLINE: Escherichia coli, Genome, Bacterial. Die Arbeit wurde bisher 49-mal zitiert (Crossref) und nennt 75 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: UKRI | Biotechnology and Biological Sciences Research Council (BBSRC).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Pangenomes exhibit remarkable variability in many prokaryotic species, much of which is maintained through the processes of horizontal gene transfer and gene loss. Repeated acquisitions of near-identical homologs can easily be observed across pangenomes, leading to the question of whether these parallel events potentiate similar evolutionary trajectories, or whether the remarkably different genetic backgrounds of the recipients mean that postacquisition evolutionary trajectories end up being quite different. In this study, we present a machine learning method that predicts the presence or absence of genes in the Escherichia coli pangenome based on complex patterns of the presence or absence of other accessory genes within a genome. Our analysis leverages the repeated transfer of genes through the E. coli pangenome to observe patterns of repeated evolution following similar events. We find that the presence or absence of a substantial set of genes is highly predictable from other genes alone, indicating that selection potentiates and maintains gene–gene co-occurrence and avoidance relationships deterministically over long-term bacterial evolution and is robust to differences in host evolutionary history. We propose that at least part of the pangenome can be understood as a set of genes with relationships that govern their likely cohabitants, analogous to an ecosystem’s set of interacting organisms. Our findings indicate that intragenomic gene fitness effects may be key drivers of prokaryotic evolution, influencing the repeated emergence of complex gene–gene relationships across the pangenome.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Escherichia coliGenome, BacterialBacteriaEvolution, MolecularPhylogenyProkaryotic Cells

Stichwörter der Autor:innen

evolutionmachine learningpangenomes

Autor:innen und Institutionen

  • School of Life Sciences, The University of Nottingham, Nottingham NG7 2UH, United Kingdom.
  • School of Science and Technology, Nottingham Trent University, Nottingham NG1 4FQ, United Kingdom.

ORCID-Profile: Alan J S Beavan, Maria Rosa Domingo-Sananes, James O McInerney

Förderung

  • UKRI | Biotechnology and Biological Sciences Research Council (BBSRC)

Zitieren

APA

Beavan, A. J. S., Domingo-Sananes, M. R., & McInerney, J. O. (2024). Contingency, repeatability, and predictability in the evolution of a prokaryotic pangenome. Proceedings of the National Academy of Sciences, 121(1). https://doi.org/10.1073/pnas.2304934120

Vancouver

Beavan AJS, Domingo-Sananes MR, McInerney JO. Contingency, repeatability, and predictability in the evolution of a prokaryotic pangenome. Proceedings of the National Academy of Sciences. 2024;121(1). doi:10.1073/pnas.2304934120

BibTeX
@article{Beavan2024,
  author = {Beavan, Alan J S and Domingo-Sananes, Maria Rosa and McInerney, James O},
  title = {Contingency, repeatability, and predictability in the evolution of a prokaryotic pangenome},
  journal = {Proceedings of the National Academy of Sciences},
  year = {2024},
  volume = {121},
  number = {1},
  doi = {10.1073/pnas.2304934120}
}
Kostenlos starten →