IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0080377.html
   My bibliography  Save this article

DNA-COMPACT: DNA COMpression Based on a Pattern-Aware Contextual Modeling Technique

Author

Listed:
  • Pinghao Li
  • Shuang Wang
  • Jihoon Kim
  • Hongkai Xiong
  • Lucila Ohno-Machado
  • Xiaoqian Jiang

Abstract

Genome data are becoming increasingly important for modern medicine. As the rate of increase in DNA sequencing outstrips the rate of increase in disk storage capacity, the storage and data transferring of large genome data are becoming important concerns for biomedical researchers. We propose a two-pass lossless genome compression algorithm, which highlights the synthesis of complementary contextual models, to improve the compression performance. The proposed framework could handle genome compression with and without reference sequences, and demonstrated performance advantages over best existing algorithms. The method for reference-free compression led to bit rates of 1.720 and 1.838 bits per base for bacteria and yeast, which were approximately 3.7% and 2.6% better than the state-of-the-art algorithms. Regarding performance with reference, we tested on the first Korean personal genome sequence data set, and our proposed method demonstrated a 189-fold compression rate, reducing the raw file size from 2986.8 MB to 15.8 MB at a comparable decompression cost with existing algorithms. DNAcompact is freely available at https://sourceforge.net/projects/dnacompact/for research purpose.

Suggested Citation

  • Pinghao Li & Shuang Wang & Jihoon Kim & Hongkai Xiong & Lucila Ohno-Machado & Xiaoqian Jiang, 2013. "DNA-COMPACT: DNA COMpression Based on a Pattern-Aware Contextual Modeling Technique," PLOS ONE, Public Library of Science, vol. 8(11), pages 1-13, November.
  • Handle: RePEc:plo:pone00:0080377
    DOI: 10.1371/journal.pone.0080377
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0080377
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0080377&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0080377?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sultan Al Yami & Chun-Hsi Huang, 2019. "LFastqC: A lossless non-reference-based FASTQ compressor," PLOS ONE, Public Library of Science, vol. 14(11), pages 1-10, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0080377. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.