홈
탐색
nav.journalClub
트렌드
더보기
synapse
⌘+K
언어
한국어
한국어
k ache-hash: A dynamic, concurrent, and cache-efficient hash table for streaming k -mer operations | Synapse
March 3, 2026
Open Access
k ache-hash: A dynamic, concurrent, and cache-efficient hash table for streaming k -mer operations
JK
Jamshed Khan
Northeastern University
RP
Rob Patro
PP
Prashant Pandey
Key Points
The dynamic hash table significantly enhances cache efficiency for streaming k-mer operations, improving performance.
The implementation shows a marked improvement in speed, optimizing resource usage while handling large data streams.
Analysis reveals the hash table design reduces caching overhead, enabling more efficient data retrieval across various contexts.
The approach may foster better performance of bioinformatics applications, encouraging further exploration of efficient data structures.
Abstract
Supplementary material are available for this manuscript.
Read Full Paper
externally
Mark Helpful
Like
Save
Bookmark
Relay
Share
View Full Paper
Cite This Study
Copy
Khan et al. (Mon,) studied this question.
synapsesocial.com/papers/69a761d1c6e9836116a2fe3a
https://doi.org/https://doi.org/10.64898/2026.02.13.705625
Mark Helpful
Like
Save
Bookmark
Relay
Share
View Full Paper