Efficient algorithms for simulating sequences along a phylogenetic tree.

ABSTRACT:

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 com

SUBMITTER: Wygoda E 

PROVIDER: S-EPMC12797210 | biostudies-literature | 2026 Jan

REPOSITORIES: biostudies-literature