SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing. 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.

References in zbMATH (referenced in 8 articles )

Showing results 1 to 8 of 8.
Sorted by year (citations)

  1. Jean, Géraldine; Radulescu, Andreea; Rusu, Irena: The contig assembly problem and its algorithmic solutions (2017)
  2. Rodríguez-Ezpeleta, Naiara (ed.); Hackenberg, Michael (ed.); Aransay, Ana M. (ed.): Bioinformatics for high throughput sequencing (2012)
  3. Prosperi, Mattia C. F.; Prosperi, Luciano; Bruselles, Alessandro; Abbate, Isabella; Rozera, Gabriella; Vincenti, Donatella; Solmone, Maria Carmela; Capobianchi, Maria Rosaria; Ulivi, Giovanni: Combinatorial analysis and algorithms for quasispecies reconstruction using next-generation sequencing (2011) ioport
  4. Kingsford, Carl; Schatz, Michael C.; Pop, Mihai: Assembly complexity of prokaryotic genomes using short reads (2010) ioport
  5. Schmieder, Robert; Lim, Yan Wei; Rohwer, Forest; Edwards, Robert: Tagcleaner: identification and removal of tag sequences from genomic and metagenomic datasets (2010) ioport
  6. Jackson, Benjamin G.; Schnable, Patrick S.; Aluru, Srinivas: Parallel short sequence assembly of transcriptomes (2009) ioport
  7. Jr., Douglas W. Bryant; Wong, Weng-Keen; Mockler, Todd C.: QSRA - a quality-value guided \textitdenovoshort read assembler (2009) ioport
  8. Wang, Wendi; Zhang, Peiheng; Liu, Xinchun: Short read DNA fragment anchoring algorithm (2009) ioport