{"ID":2872569,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2509.08503","arxiv_id":"2509.08503","title":"Checking and producing word attractors","abstract":"The article focuses on word (or string) attractors, which are sets of positions related to the text compression efficiency of the underlying word. The article presents two combinatorial algorithms based on Suffix automata or Directed Acyclic Word Graphs. The first algorithm decides in linear time whether a set of positions on the word is an attractor of the word. The second algorithm generates an attractor for a given word in a greedy manner. Although this problem is NP-hard, the algorithm is efficient and produces very small attractors for several well-known families of words.","short_abstract":"The article focuses on word (or string) attractors, which are sets of positions related to the text compression efficiency of the underlying word. The article presents two combinatorial algorithms based on Suffix automata or Directed Acyclic Word Graphs. The first algorithm decides in linear time whether a set of posit...","url_abs":"https://arxiv.org/abs/2509.08503","url_pdf":"https://arxiv.org/pdf/2509.08503v1","authors":"[\"Marie-Pierre Béal\",\"Maxime Crochemore\",\"Giuseppe Romana\"]","published":"2025-09-10T11:24:53Z","proceeding":"cs.DS","tasks":"[\"cs.DS\",\"cs.FL\"]","methods":"[]","has_code":false}