Lossless Indexing with Counting de Bruijn Graphs | SpringerLink
Skip to main content

Lossless Indexing with Counting de Bruijn Graphs

  • Conference paper
  • First Online:
Research in Computational Molecular Biology (RECOMB 2022)

Abstract

Motivation: High-throughput sequencing data is rapidly accumulating in public repositories. Making this resource accessible for interactive analysis at scale requires efficient approaches for its storage and indexing.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 8579
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 10724
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Almodaresi, F., Pandey, P., Ferdman, M., Johnson, R., Patro, R.: An efficient, scalable, and exact representation of high-dimensional color information enabled using de Bruijn graph search. J. Comput. Biol. 27(4), 485–499 (2020)

    Article  Google Scholar 

  2. Bradley, P., Den Bakker, H.C., Rocha, E.P., McVean, G., Iqbal, Z.: Ultrafast search of all deposited bacterial and viral genomic data. Nat. Biotechnol. 37(2), 152–159 (2019)

    Article  Google Scholar 

  3. Danciu, D., Karasikov, M., Mustafa, H., Kahles, A., Rätsch, G.: Topology-based sparsification of graph annotations. Bioinformatics 37(Suppl._1), i169–i176 (2021). https://doi.org/10.1093/bioinformatics/btab330

  4. Karasikov, M., et al.: Metagraph: indexing and analysing nucleotide archives at petabase-scale. bioRxiv (2020). https://doi.org/10.1101/2020.10.01.322164. https://www.biorxiv.org/content/early/2020/11/03/2020.10.01.322164

  5. Marchet, C., Iqbal, Z., Gautheret, D., Salson, M., Chikhi, R.: REINDEER: efficient indexing of k-mer presence and abundance in sequencing datasets. Bioinformatics 36(Suppl._1), i177–i185 (2020). https://doi.org/10.1093/bioinformatics/btaa487

  6. Pandey, P., Almodaresi, F., Bender, M.A., Ferdman, M., Johnson, R., Patro, R.: Mantis: a fast, small, and exact large-scale sequence-search index. Cell Syst. 7(2), 201–207.e4 (2018)

    Google Scholar 

Download references

Acknowledgments

M. K. and H. M. are funded as part of Swiss National Research Programme (NRP) 75 “Big Data” by the SNSF grant #407540_167331. M. K., H. M., and A. K. are also partially funded by ETH core funding (to G. R.).

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Gunnar Rätsch or André Kahles .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Karasikov, M., Mustafa, H., Rätsch, G., Kahles, A. (2022). Lossless Indexing with Counting de Bruijn Graphs. In: Pe'er, I. (eds) Research in Computational Molecular Biology. RECOMB 2022. Lecture Notes in Computer Science(), vol 13278. Springer, Cham. https://doi.org/10.1007/978-3-031-04749-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-04749-7_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-04748-0

  • Online ISBN: 978-3-031-04749-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics