Abstract
AbstractMotivationA dictionary of k-mers is a data structure that stores a set of n distinct k-mers and supports membership queries. This data structure is at the hearth of many important tasks in computational biology. High-throughput sequencing of DNA can produce very large k-mer sets, in the size of billions of strings – in such cases, the memory consumption and query efficiency of the data structure is a concrete challenge.ResultsTo tackle this problem, we describe a compressed and associative dictionary for k-mers, that is: a data structure where strings are represented in compact form and each of them is associated to a unique integer identifier in the range [0, n). We show that some statistical properties of k-mer minimizers can be exploited by minimal perfect hashing to substantially improve the space/time trade-off of the dictionary compared to the best-known solutions.AvailabilityThe C++ implementation of the dictionary is available at https://github.com/jermp/sshash.Contactgiulio.ermanno.pibiri@isti.cnr.it
Publisher
Cold Spring Harbor Laboratory
Reference36 articles.
1. A space and time-efficient index for the compacted colored de bruijn graph;Bioinformatics,2018
2. Timo Bingmann , Phelim Bradley , Florian Gauger , and Zamin Iqbal . Cobs: a compact bit-sliced signature index. In International Symposium on String Processing and Information Retrieval, pages 285–303. Springer, 2019.
3. scMC learns biological variation through the alignment of multiple single-cell genomics datasets
4. Michael Burrows and David Wheeler . A block-sorting lossless data compression algorithm. In Digital SRC Research Report. Citeseer, 1994.
5. Rayan Chikhi , Antoine Limasset , Shaun Jackman , Jared T Simpson , and Paul Medvedev . On the representation of de bruijn graphs. In International conference on Research in computational molecular biology, pages 35–55. Springer, 2014. URL https://github.com/jts/dbgfm.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献