Smallest Suffixient Sets as a Repetitiveness Measure
By: Gonzalo Navarro, Giuseppe Romana, Cristian Urbina
Potential Business Impact:
Finds patterns in repeating text faster.
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.
Similar Papers
Testing Suffixient Sets
Data Structures and Algorithms
Finds text patterns faster by storing less.
Infinitesimal containment and sparse factors of iid
Dynamical Systems
Makes computer programs learn from tiny data.
Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries
Data Structures and Algorithms
Find words faster in huge texts.