Sparse and skew hashing of K-mers | Zendy

Giulio Ermanno Pibiri | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Sparse and skew hashing of K-mers

Author(s) -

Giulio Ermanno Pibiri

Publication year - 2022

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/btac245

Subject(s) - computer science , locality sensitive hashing , hash function , data structure , hash table , skew , theoretical computer science , integer (computer science) , identifier , set (abstract data type) , throughput , algorithm , computer security , programming language , telecommunications , wireless

A 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research