Scholarlink

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 \(\chi \) of the smallest suffixient set as a repetitiveness measure: we place it between known measures and study its sensitivity to various string operations.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Smallest Suffixient Sets as a Repetitiveness Measure

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Gonzalo Navarro,
  • Giuseppe Romana,
  • Cristian Urbina

摘要

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 \(\chi \) of the smallest suffixient set as a repetitiveness measure: we place it between known measures and study its sensitivity to various string operations.