A Memory Efficient Short Read <i>De Novo</i> Assembly Algorithm

この論文にアクセスする

著者

抄録

Sequencing the whole genome of various species has many applications, not only in understanding biological systems, but also in medicine, pharmacy, and agriculture. In recent years, the emergence of high-throughput next generation sequencing technologies has dramatically reduced the time and costs for whole genome sequencing. These new technologies provide ultrahigh throughput with a lower per-unit data cost. However, the data are generated from very short fragments of DNA. Thus, it is very important to develop algorithms for merging these fragments. One method of merging these fragments without using a reference dataset is called <i>de novo</i> assembly. Many algorithms for <i>de novo</i> assembly have been proposed in recent years. Velvet and SOAPdenovo2 are well-known assembly algorithms, which have good performance in terms of memory and time consumption. However, memory consumption increases dramatically when the size of input fragments is larger. Therefore, it is necessary to develop an alternative algorithm with low memory usage. In this paper, we propose an algorithm for <i>de novo</i> assembly with lower memory. In our experiments using <i>E.coli</i> K-12 strain MG 1655 and human chromosome 14, the memory consumption of our proposed algorithm was less than that of other popular assemblers.

収録刊行物

  • IPSJ Transactions on Bioinformatics

    IPSJ Transactions on Bioinformatics 8(0), 2-8, 2015

    一般社団法人 情報処理学会

各種コード

  • NII論文ID(NAID)
    130004952389
  • 本文言語コード
    ENG
  • データ提供元
    J-STAGE 
ページトップへ