MOTIVATION
Simulating complex evolution scenarios of multiple populations is an important task for answering many basic questions relating to population genomics. Apart from the population samples, the underlying Ancestral Recombinations Graph (ARG) is an additional important means in hypothesis checking and reconstruction studies. Furthermore, complex simulations require a plethora of interdependent parameters making even the scenario-specification highly non-trivial.
RESULTS
We present an algorithm SimRA that simulates generic multiple population evolution model with admixture. It is based on random graphs that improve dramatically in time and space requirements of the classical algorithm of single populations.Using the underlying random graphs model, we also derive closed forms of expected values of the ARG characteristics i.e., height of the graph, number of recombinations, number of mutations and population diversity in terms of its defining parameters. This is crucial in aiding the user to specify meaningful parameters for the complex scenario simulations, not through trial-and-error based on raw compute power but intelligent parameter estimation. To the best of our knowledge this is the first time closed form expressions have been computed for the ARG properties. We show that the expected values closely match the empirical values through simulations.Finally, we demonstrate that SimRA produces the ARG in compact forms without compromising any accuracy. We demonstrate the compactness and accuracy through extensive experiments.
AVAILABILITY AND IMPLEMENTATION
SimRA (Simulation based on Random graph Algorithms) source, executable, user manual and sample input-output sets are available for downloading at: https://github.com/ComputationalGenomics/SimRA CONTACT: : parida@us.ibm.com
SUPPLEMENTARY INFORMATION
Supplementary data are available at Bioinformatics online.
[1]
Laxmi Parida,et al.
Graph Model of Coalescence with Recombinations
,
2010
.
[2]
Laxmi Parida,et al.
Ancestral Recombinations Graph: A Reconstructability Perspective Using Random-Graphs Framework
,
2010,
J. Comput. Biol..
[3]
Laxmi Parida,et al.
Sum of parts is greater than the whole: inference of common genetic history of populations
,
2013,
BMC Genomics.
[4]
R. Griffiths,et al.
An ancestral recombination graph
,
1997
.
[5]
Richard R. Hudson,et al.
Generating samples under a Wright-Fisher neutral model of genetic variation
,
2002,
Bioinform..
[6]
Carsten Wiuf,et al.
Gene Genealogies, Variation and Evolution - A Primer in Coalescent Theory
,
2004
.
[7]
Oscar E. Gaggiotti,et al.
Computer simulations: tools for population and evolutionary genetics
,
2012,
Nature Reviews Genetics.
[8]
Laxmi Parida,et al.
A minimal descriptor of an ancestral recombinations graph
,
2011,
BMC Bioinformatics.
[9]
S. Gabriel,et al.
Calibrating a coalescent simulation of human genome sequence variation.
,
2005,
Genome research.
[10]
Laxmi Parida,et al.
Topological Signatures for Population Admixture
,
2015,
RECOMB.
[11]
Naren Ramakrishnan,et al.
Problem Solving Handbook in Computational Biology and Bioinformatics
,
2010
.
[12]
J. Kingman.
On the genealogy of large populations
,
1982,
Journal of Applied Probability.
[13]
Laxmi Parida.
Nonredundant representation of ancestral recombinations graphs.
,
2012,
Methods in molecular biology.