Non-overlapping indexing in BWT-runs bounded space

We revisit the non-overlapping indexing problem for an efficient repetition-aware solution. The problem is to index a text T[1..n], such that whenever a pattern P[1..p] comes as a query, we can report the largest set of non-overlapping occurrences of P in T. A previous index by Cohen and Porat [ISAA...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1056; s. 115512
Hlavní autori:	Gibney, Daniel, MacNichol, Paul, Thankachan, Sharma V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 21.11.2025
Predmet:	Data compression Data structures String algorithms Text indexing String algorithms Text indexing Data structures Data compression
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!