IDEAS home Printed from https://ideas.repec.org/a/nat/natcom/v9y2018i1d10.1038_s41467-017-02480-6.html
   My bibliography  Save this article

Optimal compressed representation of high throughput sequence data via light assembly

Author

Listed:
  • Antonio A. Ginart

    (Stanford University)

  • Joseph Hui

    (Massachusetts Institute of Technology)

  • Kaiyuan Zhu

    (Indiana University Bloomington)

  • Ibrahim Numanagić

    (Massachusetts Institute of Technology)

  • Thomas A. Courtade

    (University of California)

  • S. Cenk Sahinalp

    (Indiana University Bloomington)

  • David N. Tse

    (Stanford University)

Abstract

The most effective genomic data compression methods either assemble reads into contigs, or replace them with their alignment positions on a reference genome. Such methods require significant computational resources, but faster alternatives that avoid using explicit or de novo-constructed references fail to match their performance. Here, we introduce a new reference-free compressed representation for genomic data based on light de novo assembly of reads, where each read is represented as a node in a (compact) trie. We show how to efficiently build such tries to compactly represent reads and demonstrate that among all methods using this representation (including all de novo assembly based methods), our method achieves the shortest possible output. We also provide an lower bound on the compression rate achievable on uniformly sampled genomic read data, which is approximated by our method well. Our method significantly improves the compression performance of alternatives without compromising speed.

Suggested Citation

  • Antonio A. Ginart & Joseph Hui & Kaiyuan Zhu & Ibrahim Numanagić & Thomas A. Courtade & S. Cenk Sahinalp & David N. Tse, 2018. "Optimal compressed representation of high throughput sequence data via light assembly," Nature Communications, Nature, vol. 9(1), pages 1-9, December.
  • Handle: RePEc:nat:natcom:v:9:y:2018:i:1:d:10.1038_s41467-017-02480-6
    DOI: 10.1038/s41467-017-02480-6
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/s41467-017-02480-6
    File Function: Abstract
    Download Restriction: no

    File URL: https://libkey.io/10.1038/s41467-017-02480-6?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
    ---><---

    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:nat:natcom:v:9:y:2018:i:1:d:10.1038_s41467-017-02480-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.com .

    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.