Absent subsequences in words
From MaRDI portal
Publication:2695493
DOI10.1007/978-3-030-89716-1_8OpenAlexW3208855882MaRDI QIDQ2695493
Stefan Siemer, Maria Kosche, Florin Manea, Tore Koß
Publication date: 31 March 2023
Full work available at URL: https://arxiv.org/abs/2108.13968
Related Items
Computing longest (common) Lyndon subsequences, Absent Subsequences in Words, Computing longest Lyndon subsequences and longest common Lyndon subsequences, Ranking and Unranking k-Subsequence Universal Words, Longest Common Subsequence with Gap Constraints, On Arch Factorization and Subword Universality for Words and Compressed Words, Longest bordered and periodic subsequences, Subsequences in bounded ranges: matching and analysis problems, Unnamed Item, Nearly \(k\)-universal words -- investigating a part of Simon's congruence, Nearly \(k\)-universal words -- investigating a part of Simon's congruence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata and forbidden words
- Using minimal absent words to build phylogeny
- Another generalization of abelian equivalence: binomial complexity of infinite words
- The level ancestor problem simplified
- Patterns in permutations and words.
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- Absoluteness of subword inequality is undecidable
- Words and forbidden factors
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- Alignment-free sequence comparison using absent words
- Directed acyclic subsequence graph -- overview
- Subword histories and Parikh matrices
- Absent words in a sliding window with applications
- Languages ordered by the subword order
- Connections between subwords and certain matrix mappings
- Word assembly through minimal forbidden words
- On the index of Simon's congruence for piecewise testability
- Searching subsequences
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- The Complexity of Some Problems on Subsequences and Supersequences
- The String-to-String Correction Problem
- The Complexity of Downward Closure Comparisons
- Scattered Factor-Universality of Words
- The Subtrace Order and Counting First-Order Logic
- The Height of Piecewise-Testable Languages with Applications in Logical Complexity
- Minimal forbidden factors of circular words
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- On extended special factors of a word
