EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Efficient algorithms for simulating sequences along a phylogenetic tree

Elya Wygoda, Asher Moshe, Nimrod Serok, Edo Dotan iD, Noa Ecker, Naiel Jabareen, Omer Israeli, Itsik Pe'er, Tal Pupko iD

Bioinformatics · 2026

DOI: 10.1093/bioinformatics/btaf686 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bioinformatics, 2026. Verfasst von Elya Wygoda und 8 weiteren Autor:innen. Beteiligte Einrichtung: The Shmunis School of Biomedicine and Cancer Research, George S. Wise Faculty of Life Sciences, Tel Aviv University, Tel Aviv 69978, Israel. Hauptthemen laut MEDLINE: Algorithms, Phylogeny, Computational Biology, Sequence Analysis, DNA. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 64 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Israel Science Foundation (ISF).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Motivation Sequence simulations along phylogenetic trees play an important role in numerous molecular evolution studies such as benchmarking algorithms for ancestral sequence reconstruction, multiple sequence alignment, and phylogeny inference. They are also used in phylogenetic model-selection tasks, including the inference of selective forces. Recently, Approximate Bayesian Computation (ABC)-based approaches have been developed for inferring parameters of complex evolutionary models, which rely on massive generation of simulated data. For all these applications, computationally efficient sequence simulators are essential. Results In this study, we investigate fast algorithms for simulating sequences along a phylogenetic tree, focusing on accelerating the speed-limiting component of the simulation process: handling insertion and deletion (indel) events. We demonstrate that data structures which efficiently store indel events along a tree can substantially accelerate the simulation process compared to a naive approach. To illustrate the utility of this efficient simulator, we integrated it into an ABC-based algorithm for inferring indel model parameters and applied it to study indel dynamics within Chiroptera. Availability and implementation The source code for the different simulation algorithms, alongside the data used, is available at: https://github.com/nimrodSerokTAU/evo-sim. The simulator has also been integrated into SpartaABC, a website for the inference of indel parameters, accessible at: https://spartaabc.tau.ac.il/.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsPhylogenyComputational BiologySequence Analysis, DNAINDEL MutationComputer SimulationSoftwareBayes TheoremEvolution, MolecularAnimalsSequence Alignment

Autor:innen und Institutionen

  • The Shmunis School of Biomedicine and Cancer Research, George S. Wise Faculty of Life Sciences, Tel Aviv University, Tel Aviv 69978, Israel.
  • The Henry and Marilyn Taub Faculty of Computer Science, Technion-Israel Institute of Technology, Haifa 3200003, Israel.
  • Department of Computer Science, Columbia University, New York, NY, 10027-7003, United States.

ORCID-Profile: Edo Dotan, Tal Pupko

Förderung

  • Israel Science Foundation (ISF)

Zitieren

APA

Wygoda, E., Moshe, A., Serok, N., Dotan, E., Ecker, N., Jabareen, N., Israeli, O., Pe'er, I., & Pupko, T. (2026). Efficient algorithms for simulating sequences along a phylogenetic tree. Bioinformatics. https://doi.org/10.1093/bioinformatics/btaf686

Vancouver

Wygoda E, Moshe A, Serok N, Dotan E, Ecker N, Jabareen N, et al. Efficient algorithms for simulating sequences along a phylogenetic tree. Bioinformatics. 2026. doi:10.1093/bioinformatics/btaf686

BibTeX
@article{Wygoda2026,
  author = {Wygoda, Elya and Moshe, Asher and Serok, Nimrod and Dotan, Edo and Ecker, Noa and Jabareen, Naiel and Israeli, Omer and Pe'er, Itsik and Pupko, Tal},
  title = {Efficient algorithms for simulating sequences along a phylogenetic tree},
  journal = {Bioinformatics},
  year = {2026},
  doi = {10.1093/bioinformatics/btaf686}
}
Kostenlos starten →