Evidence map›Paper›PMID 31725321›Full record

ArticleJournal of computational biology : a journal of computational molecular cell biology2020

Predicting the Number of Bases to Attain Sufficient Coverage in High-Throughput Sequencing Experiments.

Chao Deng, Timothy Daley, Peter Calabrese, Jie Ren, Andrew D Smith

Open access · greenAbstract read
In one paragraph

Article in Journal of computational biology : a journal of computational molecular cell biology, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing papers in PubMed
–field-weighted citation impact, top 89% of its field
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

4 citing papers in PubMed, 3 citations in OpenAlex.

  1. Article
  2. Review
  3. Article
  4. 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

5 authors at 1 institution in 1 country.

Chao DengQuantitative and Computational Biology, University of Southern California, Los Angeles, California, USA.
Timothy DaleyDepartments of Statistics and Bioengineering, Stanford University, Stanford, California, USA.
Peter CalabreseQuantitative and Computational Biology, University of Southern California, Los Angeles, California, USA.
Jie RenQuantitative and Computational Biology, University of Southern California, Los Angeles, California, USA.
Andrew D SmithQuantitative and Computational Biology, University of Southern California, Los Angeles, California, USA.
University of Southern California · US

Funding

Methods to predict molecular complexity in sequencing experimentsR01HG007650 · NHGRI · UNIVERSITY OF SOUTHERN CALIFORNIA · PI SMITH, ANDREW DAVID · 2015 to 2017
$1.2M
NHGRI NIH HHS R01 HG007650
6 · The paper itself

Abstract

For many types of high-throughput sequencing experiments, success in downstream analysis depends on attaining sufficient coverage for individual positions in the genome. For example, when identifying single-nucleotide variants de novo, the number of reads supporting a particular variant call determines our confidence in that variant call. If sequenced reads are distributed uniformly along the genome, the coverage of a nucleotide position is easily approximated by a Poisson distribution, with rate equal to average sequencing depth. Unfortunately, as has become well known, high-throughput sequencing data are never uniform. The numerous factors contributing to variation in coverage have resisted attempts at direct modeling and change along with minor adjustments in the underlying technology. We propose a new nonparametric method to predict the portion of a genome that will attain some specified minimum coverage, as a function of sequencing effort, using information from a shallow sequencing experiment from the same library. Simulations show our approach performs well under an array of distributional assumptions that deviate from uniformity. We applied this approach to estimate coverage at varying depths in single-cell whole-genome sequencing data from multiple protocols. These resulted in highly accurate predictions, demonstrating the effectiveness of our approach in analyzing complexity of sequencing libraries and optimizing design of sequencing experiments.

Indexed as

Models, GeneticAlgorithmsGenomeHigh-Throughput Nucleotide SequencingSingle-Cell AnalysisWhole Genome Sequencinggenome coveragemixture of Poisson distributionsnonparametricPadé approximantsingle-cell whole-genome sequencingspecies accumulation curve

Identifiers

PMID31725321
PMCPMC7398442
OpenAlexW2987233838

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.