Solving the minimal positional substring cover problem in sublinear space (Q6891085)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8130341
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the minimal positional substring cover problem in sublinear space |
scientific article; zbMATH DE number 8130341 |
Statements
Solving the minimal positional substring cover problem in sublinear space (English)
0 references
2 December 2025
0 references
positional Burrows-Wheeler transform
0 references
\(r\)-index
0 references
minimal position substring cover
0 references
set-maximal exact matches
0 references
