Computational methods for the coalescent
From MaRDI portal
coalescent processMarkov chain Monte Carlopopulation geneticssampling distributionsvariable population size
Signal detection and filtering (aspects of stochastic processes) (60G35) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computational methods for problems pertaining to biology (92-08) Problems related to evolution (92D15)
Recommendations
- Computational inference beyond Kingman's coalescent
- Simulating probability distributions in the coalescent
- A computational view of population genetics
- Theory and applications of a deterministic approximation to the coalescent model
- Sequential Markov coalescent algorithms for population models with demographic structure
- scientific article; zbMATH DE number 1263184
- A numerical method for calculating moments of coalescent times in finite populations with selection
Cited in
(22)- Recombination as a point process along sequences
- Simulating probability distributions in the coalescent
- Importance sampling for lambda-coalescents in the infinitely many sites model
- Exact limits of inference in coalescent models
- Computing the joint distribution of the total tree length across loci in populations with variable size
- Theory of genetic algorithms. II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling
- Meng and Kubatko (2009): modeling hybridization with coalescence
- Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting
- Finding the best resolution for the Kingman-Tajima coalescent: theory and applications
- Coalescent size versus coalescent time with strong selection
- Using colored Petri nets to construct coalescent hidden Markov models: automatic translation from demographic specifications to efficient inference methods
- scientific article; zbMATH DE number 7008406 (Why is no real title available?)
- Importance sampling on coalescent histories. I
- Importance sampling on coalescent histories. II: Subdivided population models
- Efficiently inferring the demographic history of many populations with allele count data
- Inference from gene trees in a subdivided population
- Ancestral inference from haplotypes and mutations
- Theory and applications of a deterministic approximation to the coalescent model
- A numerical method for calculating moments of coalescent times in finite populations with selection
- A note on distributions of times to coalescence, under time-dependent population size
- Gene mapping via the ancestral recombination graph
- Consistency of estimators of population scaled parameters using composite likelihood
This page was built for publication: Computational methods for the coalescent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4368318)