Combinatorics of minimal absent words for a sliding window

DOI10.1016/j.tcs.2022.06.002OpenAlexW3162494433MaRDI QIDQ2163388

Yuki Kuhara, Shunsuke Inenaga, Yuto Nakashima, Hideo Bannai, Takuya Mieno, Tooru Akagi, Masayuki Takeda

Publication date: 10 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.08496

zbMATH Keywords

sliding windowcombinatorics on wordsminimal absent words

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Automata and forbidden words
• Using minimal absent words to build phylogeny
• The smallest automaton recognizing the subwords of a text
• Alignment-free sequence comparison using absent words
• Absent words in a sliding window with applications
• Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
• Suffix Arrays: A New Method for On-Line String Searches
• Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
• On extended special factors of a word