Cookies on this website

We use cookies to ensure that we give you the best experience on our website. If you click 'Accept all cookies' we'll assume that you are happy to receive all cookies and you won't see this message again. If you click 'Reject all non-essential cookies' only necessary cookies providing core functionality such as security, network management, and accessibility will be enabled. Click 'Find out more' for information on how to change your cookie settings.

UNLABELLED: Coalescent simulation has become an indispensable tool in population genetics, and many complex evolutionary scenarios have been incorporated into the basic algorithm. Despite many years of intense interest in spatial structure, however, there are no available methods to simulate the ancestry of a sample of genes that occupy a spatial continuum. This is mainly due to the severe technical problems encountered by the classical model of isolation by distance. A recently introduced model solves these technical problems and provides a solid theoretical basis for the study of populations evolving in continuous space. We present a detailed algorithm to simulate the coalescent process in this model, and provide an efficient implementation of a generalized version of this algorithm as a freely available Python module. AVAILABILITY: Package available at http://pypi.python.org/pypi/ercs. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Original publication

DOI

10.1093/bioinformatics/btt067

Type

Journal article

Journal

Bioinformatics (Oxford, England)

Publication Date

04/2013

Volume

29

Pages

955 - 956

Addresses

Institute of Evolutionary Biology, University of Edinburgh, King's Buildings, West Mains Road, EH9 3JT, UK. jerome.kelleher@ed.ac.uk

Keywords

Pedigree, Genetics, Population, Evolution, Molecular, Genes, Algorithms, Models, Genetic, Computer Simulation, Software