Evidence map›Paper›PMID 21486487›Full record

ArticleBMC bioinformatics2011

Assessing the benefits of using mate-pairs to resolve repeats in de novo short-read prokaryotic assemblies.

Joshua Wetzel, Carl Kingsford, Mihai Pop

Abstract read
In one paragraph

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

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

27 citing papers in PubMed.

  1. Article
  2. Optimization of the "Ecology and evolution · 2023
    Article
  3. The Complete Genome Sequence and Structure of the OleaginousFrontiers in bioengineering and biotechnology · 2021
    Article
  4. Article
  5. Article
  6. Article
  7. Review
  8. Article
  9. Article
  10. Single-Molecule Sequencing of theG3 (Bethesda, Md.) · 2017
    Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Sequence assembly demystified.Nature reviews. Genetics · 2013
    Review
  17. Article
  18. Article
  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 WetzelCenter for Bioinformatics and Computational Biology, University of Maryland, College Park, MD, USA.
Carl Kingsford
Mihai Pop

Funding

Accurate Computational Detection of Influenza ReassortmentsR21AI085376 · NIAID · UNIV OF MARYLAND, COLLEGE PARK · PI KINGSFORD, CARLETON LEE · 2010 to 2011
$369k
NIAID NIH HHS R21 AI085376
6 · The paper itself

Abstract

backgroundNext-generation sequencing technologies allow genomes to be sequenced more quickly and less expensively than ever before. However, as sequencing technology has improved, the difficulty of de novo genome assembly has increased, due in large part to the shorter reads generated by the new technologies. The use of mated sequences (referred to as mate-pairs) is a standard means of disambiguating assemblies to obtain a more complete picture of the genome without resorting to manual finishing. Here, we examine the effectiveness of mate-pair information in resolving repeated sequences in the DNA (a paramount issue to overcome). While it has been empirically accepted that mate-pairs improve assemblies, and a variety of assemblers use mate-pairs in the context of repeat resolution, the effectiveness of mate-pairs in this context has not been systematically evaluated in previous literature.

resultsWe show that, in high-coverage prokaryotic assemblies, libraries of short mate-pairs (about 4-6 times the read-length) more effectively disambiguate repeat regions than the libraries that are commonly constructed in current genome projects. We also demonstrate that the best assemblies can be obtained by 'tuning' mate-pair libraries to accommodate the specific repeat structure of the genome being assembled - information that can be obtained through an initial assembly using unpaired reads. These results are shown across 360 simulations on 'ideal' prokaryotic data as well as assembly of 8 bacterial genomes using SOAPdenovo. The simulation results provide an upper-bound on the potential value of mate-pairs for resolving repeated sequences in real prokaryotic data sets. The assembly results show that our method of tuning mate-pairs exploits fundamental properties of these genomes, leading to better assemblies even when using an off -the-shelf assembler in the presence of base-call errors.

conclusionsOur results demonstrate that dramatic improvements in prokaryotic genome assembly quality can be achieved by tuning mate-pair sizes to the actual repeat structure of a genome, suggesting the possible need to change the way sequencing projects are designed. We propose that a two-tiered approach - first generate an assembly of the genome with unpaired reads in order to evaluate the repeat structure of the genome; then generate the mate-pair libraries that provide most information towards the resolution of repeats in the genome being assembled - is not only possible, but likely also more cost-effective as it will significantly reduce downstream manual finishing costs. In future work we intend to address the question of whether this result can be extended to larger eukaryotic genomes, where repeat structure can be quite different.

Indexed as

Genome, BacterialBacteriaHigh-Throughput Nucleotide SequencingSequence Analysis, DNA

Identifiers

PMID21486487
PMCPMC3103447

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.