Efficient algorithms for simulating sequences along a phylogenetic tree

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/.

Authors

Institutions

Publication Details

Journal
Bioinformatics
Published
2025-12-27
DOI
https://doi.org/10.1093/bioinformatics/btaf686
Citations
1
Primary Topic
Markov Chains and Monte Carlo Methods
Type
article
Field-Weighted Citation Impact
2.63
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient algorithms for simulating sequences along a phylogenetic tree

Omer Israeli, Elya Wygoda, Edo Dotan, Tal Pupko et al.
1 citations
Bioinformatics
Markov Chains and Monte Carlo Methods
2.63
article

Efficient algorithms for simulating sequences along a phylogenetic tree

Omer Israeli, Elya Wygoda, Edo Dotan, Tal Pupko, Nimrod Serok, Asher Moshe, Naiel Jabareen, Itsik Pe’er, Noa Ecker
article en
1 citations

Abstract

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/.

BioinformaticsVol. 42(1)
Tel Aviv University (IL), Technion – Israel Institute of Technology (IL), Columbia University (US)
Openalex Percentile: Top 7%
Markov Chains and Monte Carlo Methods
2.63
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.