A suffixient set is a novel combinatorial object that captures the essential information of repetitive strings in a way that, provided with a random access mechanism, supports various forms of pattern matching. In this paper, we study the size χ of the smallest suffixient set as a repetitiveness measure: we place it between known measures and study its sensitivity to various string operations.
Navarro, G., Romana, G., Urbina, C. (2026). Smallest Suffixient Sets as a Repetitiveness Measure. In G. Badkobeh, J. Radoszewski, N. Tonellotto, R. Baeza-Yates (a cura di), String Processing and Information Retrieval 32nd International Symposium, SPIRE 2025, London, UK, September 8–11, 2025, Proceedings (pp. 217-232). GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND : Springer Science and Business Media Deutschland GmbH [10.1007/978-3-032-05228-5_18].
Smallest Suffixient Sets as a Repetitiveness Measure
Romana, Giuseppe
;Urbina, Cristian
2026-01-01
Abstract
A suffixient set is a novel combinatorial object that captures the essential information of repetitive strings in a way that, provided with a random access mechanism, supports various forms of pattern matching. In this paper, we study the size χ of the smallest suffixient set as a repetitiveness measure: we place it between known measures and study its sensitivity to various string operations.
| File | Dimensione | Formato | |
|---|---|---|---|
|
NRU2025.pdf
Solo gestori archvio
Tipologia:
Versione Editoriale
Dimensione
651.87 kB
Formato
Adobe PDF
|
651.87 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
