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

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 1056; p. 115512
Main Authors:	Gibney, Daniel, MacNichol, Paul, Thankachan, Sharma V.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 21.11.2025
Subjects:	Data compression Data structures String algorithms Text indexing String algorithms Text indexing Data structures Data compression
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!