Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 629

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

De novo bacterial genome sequencing: Millions of very short reads assembled on a desktop computer

Open access
Hernandez, David, François, Patrice, Farinelli, Laurent, Østerås, Magne, Schrenzel, Jacques·2008·Genome Research

Abstract

Novel high-throughput DNA sequencing technologies allow researchers to characterize a bacterial genome during a single experiment and at a moderate cost. However, the increase in sequencing throughput that is allowed by using such platforms is obtained at the expense of individual sequence read length, which must be assembled into longer contigs to be exploitable. This study focuses on the Illumina sequencing platform that produces millions of very short sequences that are 35 bases in length. We propose a de novo assembler software that is dedicated to process such data. Based on a classical overlap graph representation and on the detection of potentially spurious reads, our software generates a set of accurate contigs of several kilobases that cover most of the bacterial genome. The assembly results were validated by comparing data sets that were obtained experimentally for Staphylococcus aureus strain MW2 and Helicobacter acinonychis strain Sheeba with that of their published genomes acquired by conventional sequencing of 1.5- to 3.0-kb fragments. We also provide indications that the broad coverage achieved by high-throughput sequencing might allow for the detection of clonal polymorphisms in the set of DNA molecules being sequenced.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1101/gr.072033.107

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Research works printed but not linked: 31

  1. 10.1371/journal.pgen.0030138 · DOI
  2. 10.1016/S0140-6736(02)08713-5 · DOI · Paper page
  3. 10.1016/j.gde.2006.10.009 · DOI · Paper page
  4. 10.1038/76469 · DOI · Paper page
  5. 10.1128/AAC.50.3.1001-1012.2006 · DOI
  6. 10.1101/gr.6435207 · DOI
  7. 10.1371/journal.pbio.0050082 · DOI · Paper page
  8. 10.1371/journal.pgen.0020120 · DOI
  9. 10.1126/science.7542800 · DOI
  10. 10.1371/journal.pgen.0020007 · DOI · Paper page
  11. 10.1016/S1074-5521(98)90108-9 · DOI
  12. Idury,, 1995, A new algorithm for DNA sequence assembly, J. Comput. Biol., 2, 291, 10.1089/cmb.1995.2.291 · DOI · Paper page
  13. Keane, T. Ning, Z. (2007) Assessing assemblability of reads from new sequencing platforms. 15th Annual International Conference on Intelligent Systems for Molecular Biology and 6th European Conference on Computational Biology, Vienna, Austria, July 21–25, 2007.
  14. 10.1007/BF01188580 · DOI
  15. 10.1016/0888-7543(88)90007-9 · DOI · Paper page
  16. 10.1137/0222058 · DOI · Paper page
  17. Margulies,, 2005, Genome sequencing in microfabricated high-density picolitre reactors, Nature, 437, 376, 10.1038/nature03959 · DOI · Paper page
  18. 10.1093/nar/27.24.e34 · DOI
  19. 10.1073/pnas.0609839104 · DOI · Paper page
  20. Myers,, 2005, The fragment assembly string graph, Bioinformatics, 21, 79, 10.1093/bioinformatics/bti1114 · DOI · Paper page
  21. 10.1073/pnas.171285098 · DOI · Paper page
  22. Pop,, 2002, Genome sequence assembly: Algorithms and issues, Comput., 35, 47, 10.1109/MC.2002.1016901 · DOI
  23. 10.1093/bib/5.3.237 · DOI
  24. 10.1126/science.311.5767.1544 · DOI · Paper page
  25. 10.1186/1471-2105-6-31 · DOI
  26. 10.1073/pnas.0602138103 · DOI · Paper page
  27. 10.1186/1471-2105-8-64 · DOI · Paper page
  28. 10.1371/journal.pone.0000484 · DOI
  29. 10.1093/bioinformatics/btl629 · DOI
  30. 10.1101/gr.655102 · DOI
  31. 10.1093/nar/gni170 · DOI

Cited by

Metadata

Authors
Hernandez, D., François, P., Farinelli, L., Østerås, M., & Schrenzel, J.
Venue
Genome Research
Published
2008-03-10
Volume
18
Issue
5
Pages
802-809
ISSN
1088-9051 (ISSN-L)
OpenAlex
W2023911006
Cited by
629
References
1
Type
posted content
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.