Evidence map›Paper›PMID 25407910›Full record

ArticleBMC bioinformatics2014

NeatFreq: reference-free data reduction and coverage normalization for De Novo sequence assembly.

Jamison M McCorrison, Pratap Venepally, Indresh Singh, Derrick E Fouts, Roger S Lasken, Barbara A Methé

Open access · goldAbstract read
In one paragraph

Article in BMC bioinformatics, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

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

9 citing papers in PubMed, 18 citations in OpenAlex.

  1. Review
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. De novo meta-assembly of ultra-deep sequencing data.Bioinformatics (Oxford, England) · 2015
    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

6 authors at 1 institution in 1 country.

Jamison M McCorrisonInformatics Core Services, The J. Craig Venter Institute (JCVI), 9704 Medical Center Drive, Rockville, MD, 20850, USA. jmccorri@jcvi.org.
Pratap VenepallyInformatics Core Services, The J. Craig Venter Institute (JCVI), 9704 Medical Center Drive, Rockville, MD, 20850, USA. pratap@jcvi.org.
Indresh SinghInformatics Core Services, The J. Craig Venter Institute (JCVI), 9704 Medical Center Drive, Rockville, MD, 20850, USA. isingh@jcvi.org.
Derrick E FoutsDepartment of Genomic Medicine, The J. Craig Venter Institute (JCVI), 9704 Medical Center Drive, Rockville, MD, 20850, USA. dfouts@jcvi.org.
Roger S LaskenDepartment of Microbial & Environmental Genomics, The J. Craig Venter Institute (JCVI), 9704 Medical Center Drive, Rockville, MD20850, USA. rlasken@jcvi.org.
Barbara A MethéDepartment of Genomic Medicine, The J. Craig Venter Institute (JCVI), 9704 Medical Center Drive, Rockville, MD, 20850, USA. bmethe@jcvi.org.
J. Craig Venter Institute · US

Funding

Construction Of A Reference Sequence Data Set For The Human Microbiome ProjectU54AI084844 · NIAID · J. CRAIG VENTER INSTITUTE, INC. · PI NELSON, KAREN E. · 2009 to 2012
$10.3M
NIAID NIH HHS HHSN272200900007CNIAID NIH HHS U54 AI084844NIAID NIH HHS U54-AI084844
6 · The paper itself

Abstract

backgroundDeep shotgun sequencing on next generation sequencing (NGS) platforms has contributed significant amounts of data to enrich our understanding of genomes, transcriptomes, amplified single-cell genomes, and metagenomes. However, deep coverage variations in short-read data sets and high sequencing error rates of modern sequencers present new computational challenges in data interpretation, including mapping and de novo assembly. New lab techniques such as multiple displacement amplification (MDA) of single cells and sequence independent single primer amplification (SISPA) allow for sequencing of organisms that cannot be cultured, but generate highly variable coverage due to amplification biases.

resultsHere we introduce NeatFreq, a software tool that reduces a data set to more uniform coverage by clustering and selecting from reads binned by their median kmer frequency (RMKF) and uniqueness. Previous algorithms normalize read coverage based on RMKF, but do not include methods for the preferred selection of (1) extremely low coverage regions produced by extremely variable sequencing of random-primed products and (2) 2-sided paired-end sequences. The algorithm increases the incorporation of the most unique, lowest coverage, segments of a genome using an error-corrected data set. NeatFreq was applied to bacterial, viral plaque, and single-cell sequencing data. The algorithm showed an increase in the rate at which the most unique reads in a genome were included in the assembled consensus while also reducing the count of duplicative and erroneous contigs (strings of high confidence overlaps) in the deliverable consensus. The results obtained from conventional Overlap-Layout-Consensus (OLC) were compared to simulated multi-de Bruijn graph assembly alternatives trained for variable coverage input using sequence before and after normalization of coverage. Coverage reduction was shown to increase processing speed and reduce memory requirements when using conventional bacterial assembly algorithms.

conclusionsThe normalization of deep coverage spikes, which would otherwise inhibit consensus resolution, enables High Throughput Sequencing (HTS) assembly projects to consistently run to completion with existing assembly software. The NeatFreq software package is free, open source and available at https://github.com/bioh4x/NeatFreq .

Indexed as

SoftwareAlgorithmsGenomicsHigh-Throughput Nucleotide SequencingSequence Analysis, DNA

Identifiers

PMID25407910
PMCPMC4245761
OpenAlexW2062610273

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.