Back to search

Article

<i>k</i> ache-hash: A dynamic, concurrent, and cache-efficient hash table for streaming <i>k</i> -mer operations

2026-02-16

Abstract excerpt

<h4>Motivation</h4> Hash tables are fundamental to computational genomics, where keys are often k -mers—fixed-length substrings that exhibit a “streaming” property: consecutive k -mers share k−1 nucleotides and are processed in order. Existing static data structures exploit this locality but cannot support dynamic updates, while state-of-the-art concurrent hash tables support dynamic operations but ignore k -m...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work
cfca2830-332a-521a-9439-eb8eabbfca34
DOI
10.64898/2026.02.13.705625
Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest
Interactive article relationship graphSelect a related publication card to move it into the centre and load its closest explainable connections. Solid lines are source-backed structured connections. Dashed lines are semantic discovery signals and are not scientific evidence.
<i>k</i> ache-hash: A dynamic, concurrent, and cache-efficient hash table for streaming <i>k</i> -mer operationsDOI 10.64898/2026.02.13.705625
Select a neighboring publication to make it the new centre.