Efficient algorithms for simulating sequences along a phylogenetic tree.

Wygoda E, Moshe A, Serok N, Dotan E, Ecker N, Jabareen N, Israeli O, Pe'er I, Pupko T

Open source

DOI
10.1093/bioinformatics/btaf686
Published
2026 Jan 2
Container
Bioinformatics (Oxford, England)
Publisher
Not recorded
Open access
yes

Credibility signals

limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1093/bioinformatics/btaf686,
  title = {Efficient algorithms for simulating sequences along a phylogenetic tree.},
  author = {Wygoda E and Moshe A and Serok N and Dotan E and Ecker N and Jabareen N and Israeli O and Pe'er I and Pupko T},
  year = {2026},
  journal = {Bioinformatics (Oxford, England)},
  doi = {10.1093/bioinformatics/btaf686},
  url = {https://doi.org/10.1093/bioinformatics/btaf686}
}

RIS

TY  - JOUR
TI  - Efficient algorithms for simulating sequences along a phylogenetic tree.
AU  - Wygoda E
AU  - Moshe A
AU  - Serok N
AU  - Dotan E
AU  - Ecker N
AU  - Jabareen N
AU  - Israeli O
AU  - Pe'er I
AU  - Pupko T
PY  - 2026
JO  - Bioinformatics (Oxford, England)
DO  - 10.1093/bioinformatics/btaf686
UR  - https://doi.org/10.1093/bioinformatics/btaf686
ER  - 

APA

E, W., A, M., N, S., E, D., N, E., N, J., O, I., I, P., & T, P. (2026). Efficient algorithms for simulating sequences along a phylogenetic tree.. Bioinformatics (Oxford, England). https://doi.org/10.1093/bioinformatics/btaf686

Source records