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...

Celý popis

Podrobná bibliografia

Vydané v:	Bioinformatics advances s. 1 - 10
Hlavní autori:	Sladký, Ondřej, Veselý, Pavel, Břinda, Karel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford academic 12.11.2025
Predmet:	Computer Science Data Structures and Algorithms masked superstrings Shortest superstring Membership queries Burrows-Wheeler Transform Compressed dictionary
ISSN:	2635-0041, 2635-0041
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!