Smallest Suffixient Sets as a Repetitiveness Measure
- Authors: Navarro, G.; Romana, G.; Urbina, C.
- Publication year: 2026
- Type: Contributo in atti di convegno pubblicato in volume
- OA Link: http://hdl.handle.net/10447/704324
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.