Linear-time computation of generalized minimal absent words for multiple strings

DOI10.1007/978-3-031-43980-3_27MaRDI QIDQ6545442

Takuya Mieno, Yuto Nakashima, Hideo Bannai, Kouta Okabe, Shunsuke Inenaga

Publication date: 29 May 2024

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• 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
• Constructing antidictionaries of long texts in output-sensitive space
• Combinatorics of minimal absent words for a sliding window
• Absent words in a sliding window with applications
• Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
• Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
• Minimal forbidden words and symbolic dynamics
• Complete inverted files for efficient text retrieval and analysis
• Fast detection of specific fragments against a set of sequences
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
• On extended special factors of a word

This page was built for publication: Linear-time computation of generalized minimal absent words for multiple strings