Masked superstrings as a compact, indexable, and dynamic representation of unconstrained k-mer sets

Authors

Institutions

Publication Details

Journal
SPIRE - Sciences Po Institutional REpository
Published
2025-03-05
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

Masked superstrings as a compact, indexable, and dynamic representation of unconstrained k-mer sets

Ondřej Sladký, Pavel Veselý, Karel Brinda
SPIRE - Sciences Po Institutional REpository
Algorithms and Data Compression
article

Masked superstrings as a compact, indexable, and dynamic representation of unconstrained k-mer sets

Ondřej Sladký, Pavel Veselý, Karel Brinda
article en

Abstract

No abstract available for this paper.
SPIRE - Sciences Po Institutional REpository
Charles University (CZ), ETH Zurich (CH)
Reduced inequalities
Openalex Percentile: Top 17%
Algorithms and Data Compression
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.

Masked superstrings as a compact, indexable, and dynamic representation of unconstrained k-mer sets — Ondřej Sladký, Pavel Veselý, et al. · SPIRE - Sciences Po Institutional REpository (2025) | TGRS Research Map | TGRS