The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing
Open accessAbstract
The latest revolution in the DNA sequencing field has been brought about by the development of automated sequencers that are capable of generating giga base pair data sets quickly and at low cost. Applications of such technologies seem to be limited to resequencing and transcript discovery, due to the shortness of the generated reads. In order to extend the fields of application to de novo sequencing, we developed the SHARCGS algorithm to assemble short-read (25–40-mer) data with high accuracy and speed. The efficiency of SHARCGS was tested on BAC inserts from three eukaryotic species, on two yeast chromosomes, and on two bacterial genomes (Haemophilus influenzae, Escherichia coli). We show that 30-mer-based BAC assemblies have N50 sizes >20 kbp for Drosophila and Arabidopsis and >4 kbp for human in simulations taking missing reads and wrong base calls into account. We assembled 949,974 contigs with length >50 bp, and only one single contig could not be aligned error-free against the reference sequences. We generated 36-mer reads for the genome of Helicobacter acinonychis on the Illumina 1G sequencing instrument and assembled 937 contigs covering 98% of the genome with an N50 size of 3.7 kbp. With the exception of five contigs that differ in 1–4 positions relative to the reference sequence, all contigs matched the genome error-free. Thus, SHARCGS is a suitable tool for fully exploiting novel sequencing technologies by assembling sequence contigs de novo with high confidence and by outperforming existing assembly algorithms in terms of speed and accuracy.
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
DNA sequencing with chain-terminating inhibitors
Sanger, F., Nicklen, S., & Coulson, A. R. (1977) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.74.12.5463 · Cited by 68,572
Genome sequencing in microfabricated high-density picolitre reactors
Margulies, M., Egholm, M., Altman, W. E., Attiya, S., Bader, J. S., Bemben, L. A., Berka, J., Braverman, M. S., Chen, Y.-J., Chen, Z., et al. (2005) · Nature · doi:10.1038/nature03959 · Cited by 7,693
Initial sequencing and comparative analysis of the mouse genome
Mouse Genome Sequencing Consortium (2002) · Nature · doi:10.1038/nature01262 · Cited by 7,187
Base-Calling of Automated Sequencer Traces Using Phred. I. Accuracy Assessment
Ewing, B., Hillier, L., Wendl, M. C., & Green, P. (1998) · Genome Research · doi:10.1101/gr.8.3.175 · Cited by 6,967
The Genome Sequence of Drosophila melanogaster
Adams, M. D., Celniker, S. E., Holt, R. A., Evans, C. A., Gocayne, J. D., Amanatides, P. G., Scherer, S. E., Li, P. W., Hoskins, R. A., Galle, R. F., et al. (2000) · Science · doi:10.1126/science.287.5461.2185 · Cited by 5,929
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
Whole-Genome Shotgun Assembly and Analysis of the Genome of Fugu rubripes
Aparicio, S., Chapman, J., Stupka, E., Putnam, N., Chia, J.-M., Dehal, P., Christoffels, A., Rash, S., Hoon, S., Smit, A., et al. (2002) · Science · doi:10.1126/science.1072104 · Cited by 1,591
A Whole-Genome Assembly of Drosophila
Myers, E. W., Sutton, G. G., Delcher, A. L., Dew, I. M., Fasulo, D. P., Flanigan, M. J., Kravitz, S. A., Mobarry, C. M., Reinert, K. H. J., Remington, K. A., et al. (2000) · Science · doi:10.1126/science.287.5461.2196 · Cited by 1,538
An Eulerian path approach to DNA fragment assembly
Pevzner, P. A., Tang, H., & Waterman, M. S. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.171285098 · Cited by 1,352
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
Next-generation DNA sequencing
Shendure, J., & Ji, H. (2008) · Nature Biotechnology · doi:10.1038/nbt1486 · Cited by 4,509
ABySS: A parallel assembler for short read sequence data
Simpson, J. T., Wong, K., Jackman, S. D., Schein, J. E., Jones, S. J. M., & Birol, İ. (2009) · Genome Research · doi:10.1101/gr.089532.108 · Cited by 3,608
De novo assembly of human genomes with massively parallel short read sequencing
Li, R., Zhu, H., Ruan, J., Qian, W., Fang, X., Shi, Z., Li, Y., Li, S., Shan, G., Kristiansen, K., et al. (2010) · Genome Research · doi:10.1101/gr.097261.109 · Cited by 2,926
“Some other short read assemblers have applied the overlap and extension strategy, such as SSAKE (Warren et al. 2007), VCAKE (Jeck et al. 2007) (the follower of SSAKE which can handle sequencing errors), SHARCGS (Dohm et al. 2007), and Edena (Hernandez et al. 2008).”
MethodAssembly 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
Substantial biases in ultra-short read data sets from high-throughput DNA sequencing
Dohm, J. C., Lottaz, C., Borodina, T., & Himmelbauer, H. (2008) · Nucleic Acids Research · doi:10.1093/nar/gkn425 · Cited by 1,088
Self-citationA window into third-generation sequencing
Schadt, E. E., Turner, S., & Kasarskis, A. (2010) · Human Molecular Genetics · doi:10.1093/hmg/ddq416 · Cited by 948
Next-generation sequencing technologies and their implications for crop genetics and breeding
Varshney, R. K., Nayak, S. N., May, G. D., & Jackson, S. A. (2009) · Trends in Biotechnology · doi:10.1016/j.tibtech.2009.05.006 · Cited by 936
Next-Generation Sequencing: From Basic Research to Diagnostics
Voelkerding, K. V., Dames, S. A., & Durtschi, J. D. (2009) · Clinical Chemistry · doi:10.1373/clinchem.2008.112789 · Cited by 839
ALLPATHS: De novo assembly of whole-genome shotgun microreads
Butler, J., MacCallum, I., Kleber, M., Shlyakhter, I. A., Belmonte, M. K., Lander, E. S., Nusbaum, C., & Jaffe, D. B. (2008) · Genome Research · doi:10.1101/gr.7337908 · Cited by 808
Noguchi, H., Taniguchi, T., & Itoh, T. (2008) · DNA Research · doi:10.1093/dnares/dsn027 · Cited by 653
De novo bacterial genome sequencing: Millions of very short reads assembled on a desktop computer
Hernandez, D., François, P., Farinelli, L., Østerås, M., & Schrenzel, J. (2008) · Genome Research · doi:10.1101/gr.072033.107 · Cited by 629
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
RNA-seq: from technology to biology
Marguerat, S., & Bähler, J. (2010) · Cellular and Molecular Life Sciences · doi:10.1007/s00018-009-0180-6 · Cited by 531
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
Assemblathon 1: A competitive assessment of de novo short read assembly methods
Earl, D., Bradnam, K., St. John, J., Darling, A., Lin, D., Fass, J., Yu, H. O. K., Buffalo, V., Zerbino, D. R., Diekhans, M., et al. (2011) · Genome Research · doi:10.1101/gr.126599.111 · Cited by 507
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
De novo transcriptome assembly with ABySS
Birol, I., Jackman, S. D., Nielsen, C. B., Qian, J. Q., Varhol, R., Stazyk, G., Morin, R. D., Zhao, Y., Hirst, M., Schein, J. E., et al. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp367 · Cited by 400
Genome assembly reborn: recent computational challenges
Pop, M. (2009) · Briefings in Bioinformatics · doi:10.1093/bib/bbp026 · Cited by 387
Sense from sequence reads: methods for alignment and assembly
Flicek, P., & Birney, E. (2009) · Nature Methods · doi:10.1038/nmeth.1376 · Cited by 358
GapFiller: a de novo assembly approach to fill the gap within paired reads
Nadalin, F., Vezzi, F., & Policriti, A. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-s14-s8 · Cited by 352
Ng, P. C., & Kirkness, E. F. (2010) · Methods in Molecular Biology · doi:10.1007/978-1-60327-367-1_12 · Cited by 320
(2009) · Nature Reviews Microbiology · doi:10.1038/nrmicro2122 · Cited by 320
Application of 'next-generation' sequencing technologies to microbial genetics
MacLean, D., Jones, J. D. G., & Studholme, D. J. (2009) · Nature Reviews Microbiology · doi:10.1038/nrmicro2088 · Cited by 293
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
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
Zhang, W., Chen, J., Yang, Y., Tang, Y., Shang, J., & Shen, B. (2011) · PLoS ONE · doi:10.1371/journal.pone.0017915 · Cited by 250
De novo assembly of short sequence reads
Paszkiewicz, K., & Studholme, D. J. (2010) · Briefings in Bioinformatics · doi:10.1093/bib/bbq020 · Cited by 204
Comparative studies of de novo assembly tools for next-generation sequencing technologies
Lin, Y., Li, J., Shen, H., Zhang, L., Papasian, C. J., & Deng, H. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr319 · Cited by 126
Metadata
- Authors
- Dohm, J. C., Lottaz, C., Borodina, T., & Himmelbauer, H.
- Venue
- Genome Research
- Publisher
- Cold Spring Harbor Laboratory
- Published
- 2007-10-01
- Volume
- 17
- Issue
- 11
- Pages
- 1697-1706
- ISSN
- 1088-9051 (ISSN-L)
- OpenAlex
- W2127651281
- Cited by
- 283
- References
- 21
- 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.