Evidence map›Paper›PMID 26072514›Full record

ArticleBioinformatics (Oxford, England)2015

De novo meta-assembly of ultra-deep sequencing data.

Hamid Mirebrahim, Timothy J Close, Stefano Lonardi

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 16 papers.

0numbers the graph read from it
0cells of the map it votes in
16citing 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

16 citing papers in PubMed.

  1. Article
  2. Article
  3. Complete mitochondrial genome and draft chloroplastic genome ofMitochondrial DNA. Part B, Resources · 2023
    Article
  4. Article
  5. The Genome Sequence of the OctocoralG3 (Bethesda, Md.) · 2020
    Article
  6. Article
  7. Article
  8. Review
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Review
  15. Article
  16. 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.

Hamid MirebrahimDepartment of Computer Science and Engineering and Department of Botany and Plant Sciences, University of California, Riverside, CA 92521, USA.
Timothy J CloseDepartment of Computer Science and Engineering and Department of Botany and Plant Sciences, University of California, Riverside, CA 92521, USA.
Stefano LonardiDepartment of Computer Science and Engineering and Department of Botany and Plant Sciences, University of California, Riverside, CA 92521, USA.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

unlabelledWe introduce a new divide and conquer approach to deal with the problem of de novo genome assembly in the presence of ultra-deep sequencing data (i.e. coverage of 1000x or higher). Our proposed meta-assembler Slicembler partitions the input data into optimal-sized 'slices' and uses a standard assembly tool (e.g. Velvet, SPAdes, IDBA_UD and Ray) to assemble each slice individually. Slicembler uses majority voting among the individual assemblies to identify long contigs that can be merged to the consensus assembly. To improve its efficiency, Slicembler uses a generalized suffix tree to identify these frequent contigs (or fraction thereof). Extensive experimental results on real ultra-deep sequencing data (8000x coverage) and simulated data show that Slicembler significantly improves the quality of the assembly compared with the performance of the base assembler. In fact, most of the times, Slicembler generates error-free assemblies. We also show that Slicembler is much more resistant against high sequencing error rate than the base assembler. AVAILABILITY AND IMPLEMENTATION: Slicembler can be accessed at http://slicembler.cs.ucr.edu/.

Indexed as

AlgorithmsGenes, PlantHigh-Throughput Nucleotide SequencingHordeumSequence Analysis, DNA

Identifiers

PMID26072514
PMCPMC4765875

What OpenQuestion holds

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