SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing

被引:157
|
作者
Dohm, Juliane C.
Lottaz, Claudio
Borodina, Tatiana
Himmelbauer, Heinz
机构
[1] Max Planck Inst Mol Genet, D-14195 Berlin, Germany
[2] Univ Regensburg, Inst Funct Genom Computat Diagnost, D-93053 Regensburg, Germany
关键词
D O I
10.1101/gr.6435207
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
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 oil BAC inserts from three eukaryotic species, on two yeast chromosomes, and oil 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 oil 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.
引用
收藏
页码:1697 / 1706
页数:10
相关论文
共 50 条
  • [1] HAT: de novo variant calling for highly accurate short-read and long-read sequencing data
    Ng, Jeffrey K.
    Turner, Tychele N.
    BIOINFORMATICS, 2024, 40 (01)
  • [2] Illumina short-read sequencing data, de novo assembly and annotations of the Drosophila nasuta nasuta genome
    DSouza, Stafny
    Ponnanna, Koushik
    Chokkanna, Amruthavalli
    Ramachandra, Nallur
    DATA IN BRIEF, 2021, 34
  • [3] Optimizing de novo assembly of short-read RNA-seq data for phylogenomics
    Yang, Ya
    Smith, Stephen A.
    BMC GENOMICS, 2013, 14
  • [4] Amemory efficient short read de novo assembly algorithm
    Endo, Yuki
    Toyama, Fubito
    Chiba, Chikafumi
    Mori, Hiroshi
    Shoji, Kenji
    IPSJ Transactions on Bioinformatics, 2015, 8 : 2 - 8
  • [5] Optimizing de novo assembly of short-read RNA-seq data for phylogenomics
    Ya Yang
    Stephen A Smith
    BMC Genomics, 14
  • [6] Fast search of thousands of short-read sequencing experiments
    Solomon, Brad
    Kingsford, Carl
    NATURE BIOTECHNOLOGY, 2016, 34 (03) : 300 - +
  • [7] Fast search of thousands of short-read sequencing experiments
    Brad Solomon
    Carl Kingsford
    Nature Biotechnology, 2016, 34 : 300 - 302
  • [8] De novo transcriptome assembly of the Chinese pearl barley, adlay, by full-length isoform and short-read RNA sequencing
    Kang, Sang-Ho
    Lee, Jong-Yeol
    Lee, Tae-Ho
    Park, Soo-Yun
    Kim, Chang-Kug
    PLOS ONE, 2018, 13 (12):
  • [9] De Novo Short Read Assembly Algorithm with Low Memory Usage
    Endo, Yuki
    Toyama, Fubito
    Chiba, Chikafumi
    Mori, Hiroshi
    Shoji, Kenji
    BIOINFORMATICS 2014: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON BIOINFORMATICS MODELS, METHODS AND ALGORITHMS, 2014, : 215 - 220
  • [10] De novo assembly of human genomes with massively parallel short read sequencing
    Li, Ruiqiang
    Zhu, Hongmei
    Ruan, Jue
    Qian, Wubin
    Fang, Xiaodong
    Shi, Zhongbin
    Li, Yingrui
    Li, Shengting
    Shan, Gao
    Kristiansen, Karsten
    Li, Songgang
    Yang, Huanming
    Wang, Jian
    Wang, Jun
    GENOME RESEARCH, 2010, 20 (02) : 265 - 272