Your browser doesn't support javascript.
loading
Show: 20 | 50 | 100
Results 1 - 2 de 2
Filter
Add more filters










Database
Language
Publication year range
1.
Bioinformatics ; 36(10): 3279-3280, 2020 05 01.
Article in English | MEDLINE | ID: mdl-32049321

ABSTRACT

MOTIVATION: As the density of sampled population increases, especially as studies incorporate aspects of the spatial landscape to study evolutionary processes, efficient simulation of genetic data under the coalescent becomes a primary challenge. Beyond the computational demands, coalescence-based simulation strategies have to be reconsidered because traditional assumptions about the dynamics of coalescing lineages within local populations may be violated (e.g. more than two daughter lineages may coalesce to a parent at low population densities). Specifically, to efficiently assign n lineages to m parents, the order relation between n and m strongly affects the relevant algorithm for the coalescent simulator (e.g. only when n<2m, it is reasonable to assume that two lineages, at most, can be assigned to the same parent). Controlling the details of the simulation model as a function of n and m is then crucial to represent accurately and efficiently the assignment process, but current implementations make it difficult to switch between different types of lineage mergers at run-time or even compile-time. RESULTS: With the described occupancy spectrum and algorithm that generates the support of the joint probability distribution of the occupancy spectrum; computation is much faster than realizing the whole assignment process under the coalescent. Using general definitions of lineage merges, which also makes the codebase reusable, we implement several variants of coalescent mergers, including an approximation where low probability spectrums are discarded. Comparison of runtimes and performance of the different C++ highly reusable coalescence mergers (binary, multiple, hybrids) are given, and we illustrate their potential utility with example applications. AVAILABILITY AND IMPLEMENTATION: All components are integrated into Quetzal, an open-source C++ library for coalescence available at https://becheler.github.io/pages/quetzal.html. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.


Subject(s)
Algorithms , Genetics, Population , Biological Evolution , Computer Simulation , Models, Genetic , Population Density , Probability
2.
Mol Ecol Resour ; 19(3): 788-793, 2019 May.
Article in English | MEDLINE | ID: mdl-30637945

ABSTRACT

Genetic samples can be used to understand and predict the behaviour of species living in a fragmented and temporally changing environment. In this regard, models of coalescence conditioned to an environment through an explicit modelling of population growth and migration have been developed in recent years, and simulators implementing these models have been developed, enabling biologists to estimate parameters of interest with Approximate Bayesian Computation techniques. However, model choice remains limited, and developing new coalescence simulators is extremely time consuming because code re-use is limited. We present Quetzal, a C++ library composed of re-usable components, which is sufficiently general to efficiently implement a wide range of spatially explicit coalescence-based environmental models of population genetics and to embed the simulation in an Approximate Bayesian Computation framework. Quetzal is not a simulation program, but a toolbox for programming simulators aimed at the community of scientific coders and research software engineers in molecular ecology and phylogeography. This new code resource is open-source and available at https://becheler.github.io/pages/quetzal.html along with other documentation resources.


Subject(s)
Computational Biology/methods , Genetics, Population/methods , Software
SELECTION OF CITATIONS
SEARCH DETAIL
...