The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Fragment assembly with short reads
Abstract
Motivation: Current DNA sequencing technology produces reads of about 500–750 bp, with typical coverage under 10×. New sequencing technologies are emerging that produce shorter reads (length 80–200 bp) but allow one to generate significantly higher coverage (30× and higher) at low cost. Modern assembly programs and error correction routines have been tuned to work well with current read technology but were not designed for assembly of short reads. Results: We analyze the limitations of assembling reads generated by these new technologies and present a routine for base-calling in reads prior to their assembly. We demonstrate that while it is feasible to assemble such short reads, the resulting contigs will require significant (if not prohibitive) finishing efforts. Availability: Available from the web at http://www.cse.ucsd.edu/groups/bioinformatics/software.html
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.
Integrity signals
Registry
Cites
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.
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
Base-Calling of Automated Sequencer Traces Using Phred. II. Error Probabilities
Ewing, B., & Green, P. (1998) · Genome Research · doi:10.1101/gr.8.3.186 · Cited by 5,439
CAP3: A DNA Sequence Assembly Program
Huang, X., & Madan, A. (1999) · Genome Research · doi:10.1101/gr.9.9.868 · Cited by 5,261
Cited by
Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
Zerbino, D. R., & Birney, E. (2008) · Genome Research · doi:10.1101/gr.074492.107 · Cited by 9,491
Genome sequence and analysis of the tuber crop potato
The Potato Genome Sequencing Consortium (2011) · Nature · doi:10.1038/nature10158 · Cited by 2,065
Assembly algorithms for next-generation sequencing data
Miller, J. R., Koren, S., & Sutton, G. (2010) · Genomics · doi:10.1016/j.ygeno.2010.03.001 · Cited by 1,154
LoRDEC: accurate and efficient long read error correction
Salmela, L., & Rivals, E. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu538 · Cited by 844
Wooley, J. C., Godzik, A., & Friedberg, I. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000667 · Cited by 688
Ray: Simultaneous Assembly of Reads from a Mix of High-Throughput Sequencing Technologies
Boisvert, S., Laviolette, F., & Corbeil, J. (2010) · Journal of Computational Biology · doi:10.1089/cmb.2009.0238 · Cited by 539
Bioinformatics challenges of new sequencing technology
Pop, M., & Salzberg, S. L. (2008) · Trends in Genetics · doi:10.1016/j.tig.2007.12.006 · Cited by 516
Assembling millions of short DNA sequences using SSAKE
Warren, R. L., Sutton, G. G., Jones, S. J. M., & Holt, R. A. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl629 · Cited by 495
Emerging technologies in DNA sequencing
Metzker, M. L. (2005) · Genome Research · doi:10.1101/gr.3770505 · Cited by 491
Short read fragment assembly of bacterial genomes
Chaisson, M. J., & Pevzner, P. A. (2008) · Genome Research · doi:10.1101/gr.7088808 · Cited by 441
Self-citationABACAS: algorithm-based automatic contiguation of assembled sequences
Assefa, S., Keane, T. M., Otto, T. D., Newbold, C., & Berriman, M. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp347 · Cited by 420
Exploiting sparseness in de novo genome assembly
Ye, C., Ma, Z. S., Cannon, C. H., Pop, M., & Yu, D. W. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-s6-s1 · Cited by 412
Genome assembly reborn: recent computational challenges
Pop, M. (2009) · Briefings in Bioinformatics · doi:10.1093/bib/bbp026 · Cited by 387
AUBIN‐HORTH, N., & RENN, S. C. P. (2009) · Molecular Ecology · doi:10.1111/j.1365-294x.2009.04313.x · Cited by 350
Denoising DNA deep sequencing data—high-throughput sequencing errors and their correction
Laehnemann, D., Borkhardt, A., & McHardy, A. C. (2016) · Briefings in Bioinformatics · doi:10.1093/bib/bbv029 · Cited by 296
IDBA – A Practical Iterative de Bruijn Graph De Novo Assembler
Peng, Y., Leung, H. C. M., Yiu, S. M., & Chin, F. Y. L. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-12683-3_28 · Cited by 293
Enredo and Pecan: Genome-wide mammalian consistency-based multiple alignment with paralogs
Paten, B., Herrero, J., Beal, K., Fitzgerald, S., & Birney, E. (2008) · Genome Research · doi:10.1101/gr.076554.108 · Cited by 291
Musket: a multistage k-mer spectrum-based error corrector for Illumina sequence data
Liu, Y., Schröder, J., & Schmidt, B. (2013) · Bioinformatics · doi:10.1093/bioinformatics/bts690 · Cited by 287
De novo fragment assembly with short mate-paired reads: Does the read length matter?
Chaisson, M. J., Brinza, D., & Pevzner, P. A. (2009) · Genome Research · doi:10.1101/gr.079053.108 · Cited by 279
Self-citationLighter: fast and memory-efficient sequencing error correction without counting
Song, L., Florea, L., & Langmead, B. (2014) · Genome Biology · doi:10.1186/preaccept-9663167051308943 · Cited by 258
De novo assembly of short sequence reads
Paszkiewicz, K., & Studholme, D. J. (2010) · Briefings in Bioinformatics · doi:10.1093/bib/bbq020 · Cited by 204
Metadata
- Authors
- Chaisson, M., Pevzner, P., & Tang, H.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2004-04-01
- Volume
- 20
- Issue
- 13
- Pages
- 2067-2074
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2155845142
- Cited by
- 213
- References
- 2
- FWCI
- 1.42
- Type
- journal article
- Language
- en
- Open access
- closed
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.