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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1056; S. 115512
Hauptverfasser:	Gibney, Daniel, MacNichol, Paul, Thankachan, Sharma V.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 21.11.2025
Schlagworte:	Data compression Data structures String algorithms Text indexing String algorithms Text indexing Data structures Data compression
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!