|
Title |
Smallest Suffixient Sets as a Repetitiveness Measure |
|
Authors |
Gonzalo Navarro, Giuseppe Romana, Cristian Urbina |
|
Publication date |
2025 |
|
Abstract |
Suffixient sets are a novel combinatorial object that capture 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 chi of the smallest suffixient set as a repetitiveness measure: we place it between known measures and study its sensitivity to various string operations. |
|
Pages |
217-232 |
|
Conference name |
International Symposium on String Processing and Information
Retrieval |
|
Publisher |
Springer-Verlag (Berlin/Heidelberg, Germany) |
|
Reference URL |
|
