Dataset Information

Scrm: efficiently simulating long sequences using the approximated coalescent with recombination.

ABSTRACT: Coalescent-based simulation software for genomic sequences allows the efficient in silico generation of short- and medium-sized genetic sequences. However, the simulation of genome-size datasets as produced by next-generation sequencing is currently only possible using fairly crude approximations.We present the sequential coalescent with recombination model (SCRM), a new method that efficiently and accurately approximates the coalescent with recombination, closing the gap between current approximations and the exact model. We present an efficient implementation and show that it can simulate genomic-scale datasets with an essentially correct linkage structure.

SUBMITTER: Staab PR

PROVIDER: S-EPMC4426833 | biostudies-literature | 2015 May

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

scrm: efficiently simulating long sequences using the approximated coalescent with recombination.

Staab Paul R PR Zhu Sha S Metzler Dirk D Lunter Gerton G

Bioinformatics (Oxford, England) 20150108 10

<h4>Motivation</h4>Coalescent-based simulation software for genomic sequences allows the efficient in silico generation of short- and medium-sized genetic sequences. However, the simulation of genome-size datasets as produced by next-generation sequencing is currently only possible using fairly crude approximations.<h4>Results</h4>We present the sequential coalescent with recombination model (SCRM), a new method that efficiently and accurately approximates the coalescent with recombination, clos ...[more]

PMID: 25596205

Similar Datasets

Project description:BACKGROUND: Recombination plays an important role in the maintenance of genetic diversity in many types of organisms, especially diploid eukaryotes. Recombination can be studied and used to map diseases. However, recombination adds a great deal of complexity to the genetic information. This renders estimation of evolutionary parameters more difficult. After the coalescent process was formulated, models capable of describing recombination using graphs, such as ancestral recombination graphs (ARG) were also developed. There are two typical models based on which to simulate ARG: back-in-time model such as ms and spatial model including Wiuf&Hein's, SMC, SMC', and MaCS. RESULTS: In this study, a new method of modeling coalescence with recombination, Spatial Coalescent simulator (SC), was developed, which considerably improved the algorithm described by Wiuf and Hein. The present algorithm constructs ARG spatially along the sequence, but it does not produce any redundant branches which are inevitable in Wiuf and Hein's algorithm. Interestingly, the distribution of ARG generated by the present new algorithm is identical to that generated by a typical back-in-time model adopted by ms, an algorithm commonly used to model coalescence. It is here demonstrated that the existing approximate methods such as the sequentially Markov coalescent (SMC), a related method called SMC', and Markovian coalescent simulator (MaCS) can be viewed as special cases of the present method. Using simulation analysis, the time to the most common ancestor (TMRCA) in the local trees of ARGs generated by the present algorithm was found to be closer to that produced by ms than time produced by MaCS. Sample-consistent ARGs can be generated using the present method. This may significantly reduce the computational burden. CONCLUSION: In summary, the present method and algorithm may facilitate the estimation and description of recombination in population genomics and evolutionary biology.

Dataset Information

Scrm: efficiently simulating long sequences using the approximated coalescent with recombination.

Publications

scrm: efficiently simulating long sequences using the approximated coalescent with recombination.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets