Linear-time computation of generalized minimal absent words for multiple strings
From MaRDI portal
Publication:6545442
Recommendations
- Combinatorics of minimal absent words for a sliding window
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- Minimal absent words in rooted and unrooted trees
- Absent words in a sliding window with applications
- Minimal absent words in a sliding window and applications to on-line pattern matching
Cites work
- scientific article; zbMATH DE number 1998341 (Why is no real title available?)
- Absent words in a sliding window with applications
- Alignment-free sequence comparison using absent words
- Automata and forbidden words
- Combinatorics of minimal absent words for a sliding window
- Complete inverted files for efficient text retrieval and analysis
- Computing DAWGs and minimal absent words in linear time for integer alphabets
- Constructing antidictionaries of long texts in output-sensitive space
- Fast detection of specific fragments against a set of sequences
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- Minimal forbidden words and symbolic dynamics
- On extended special factors of a word
- The smallest automaton recognizing the subwords of a text
- Using minimal absent words to build phylogeny
- Versatile succinct representations of the bidirectional Burrows-Wheeler transform
Cited in
(3)
This page was built for publication: Linear-time computation of generalized minimal absent words for multiple strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545442)
