FroM Superstring to Indexing: a space-efficient index for unconstrained k -mer sets using the Masked Burrows-Wheeler Transform (MBWT)

The growing volumes and heterogeneity of genomic data call for scalable and versatile k-mer-set indexes. However, state-of-the-art indexes such as SBWT and SSHash depend on long non-branching paths in de Bruijn graphs, which limits their efficiency for small k, sampled data, or high-diversity settin...

Full description

Bibliographic Details

Published in:	Bioinformatics advances pp. 1 - 10
Main Authors:	Sladký, Ondřej, Veselý, Pavel, Břinda, Karel
Format:	Journal Article
Language:	English
Published:	Oxford academic 12.11.2025
Subjects:	Computer Science Data Structures and Algorithms masked superstrings Shortest superstring Membership queries Burrows-Wheeler Transform Compressed dictionary
ISSN:	2635-0041, 2635-0041
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!