Evidence map›Paper›PMID 21270390›Full record

ArticleGenetics2011

An accurate sequentially Markov conditional sampling distribution for the coalescent with recombination.

Joshua S Paul, Matthias Steinrücken, Yun S Song

Abstract read
In one paragraph

Article in Genetics, 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 38 papers.

0numbers the graph read from it
0cells of the map it votes in
38citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

38 citing papers in PubMed.

  1. Review
  2. Article
  3. Review
  4. Article
  5. Likelihoods for a general class of ARGs under the SMC.bioRxiv : the preprint server for biology · 2025
    Article
  6. Article
  7. A general and efficient representation of ancestral recombination graphs.bioRxiv : the preprint server for biology · 2024
    Article
  8. Exact Decoding of a Sequentially Markov Coalescent Model in Genetics.Journal of the American Statistical Association · 2024
    Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Review
  14. Article
  15. Article
  16. Article
  17. Article
  18. Review
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Joshua S PaulComputer Science Division, University of California, Berkeley, California 94720, USA.
Matthias Steinrücken
Yun S Song

Funding

GENOMICST32HG000047 · NHGRI · UNIVERSITY OF CALIFORNIA BERKELEY · PI RASMUS NIELSEN, Daniel Soleyman Rokhsar · 2000 to 2026
$13.5M
Mathematical Models and Statistical Methods for Large-Scale Population GenomicsR01GM094402 · NIGMS · UNIVERSITY OF CALIFORNIA BERKELEY · PI SONG, YUN S · 2010 to 2018
$2.2M
DEVELOPMENT OF GENOMIC INSTRUMENTATIONK22HG000047 · NHGRI · UNIVERSITY OF CALIFORNIA IRVINE · PI BRODY, JAMES P · 2000 to 2004
$964k
NHGRI NIH HHS K22 HG000047NHGRI NIH HHS T32 HG000047NHGRI NIH HHS T32-HG00047NIGMS NIH HHS R01 GM094402NIGMS NIH HHS R01-GM094402
6 · The paper itself

Abstract

The sequentially Markov coalescent is a simplified genealogical process that aims to capture the essential features of the full coalescent model with recombination, while being scalable in the number of loci. In this article, the sequentially Markov framework is applied to the conditional sampling distribution (CSD), which is at the core of many statistical tools for population genetic analyses. Briefly, the CSD describes the probability that an additionally sampled DNA sequence is of a certain type, given that a collection of sequences has already been observed. A hidden Markov model (HMM) formulation of the sequentially Markov CSD is developed here, yielding an algorithm with time complexity linear in both the number of loci and the number of haplotypes. This work provides a highly accurate, practical approximation to a recently introduced CSD derived from the diffusion process associated with the coalescent with recombination. It is empirically demonstrated that the improvement in accuracy of the new CSD over previously proposed HMM-based CSDs increases substantially with the number of loci. The framework presented here can be adopted in a wide range of applications in population genetics, including imputing missing sequence data, estimating recombination rates, and inferring human colonization history.

Indexed as

Genetics, PopulationMarkov ChainsRecombination, GeneticAlgorithmsComputer SimulationGenetic LociHaplotypesHumansModels, GeneticProbabilitySequence Analysis, DNA

Identifiers

PMID21270390
PMCPMC3070520

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.