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

Authors

Institutions

Publication Details

Journal
bioRxiv (Cold Spring Harbor Laboratory)
Published
2026-02-16
DOI
https://doi.org/10.64898/2026.02.13.705625
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Jamshed Khan, Rob Patro, Prashant Pandey
bioRxiv (Cold Spring Harbor Laboratory)
Algorithms and Data Compression
article

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

Jamshed Khan, Rob Patro, Prashant Pandey
article en

Abstract

No abstract available for this paper.
bioRxiv (Cold Spring Harbor Laboratory)
Northeastern University (US), University of Maryland, College Park (US)
Openalex Percentile: Top 55%
Algorithms and Data Compression
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

<i>k</i> ache-hash: A dynamic, concurrent, and cache-efficient hash table for streaming <i>k</i> -mer operations — Jamshed Khan, Rob Patro, et al. · bioRxiv (Cold Spring Harbor Laboratory) (2026) | TGRS Research Map | TGRS