Absent Subsequences in Words
From MaRDI portal
Recommendations
- Absent subsequences in words
- Sequence avoiding any complete word
- Absent words in a sliding window with applications
- Subsequence covers of words
- Words avoiding repetitions in arithmetic progressions
- Unique Subwords in Nonperiodic Words
- Alignment-free sequence comparison using absent words
- Words avoiding complementary subwords
- scientific article; zbMATH DE number 1809720
- scientific article; zbMATH DE number 1870556
Cites work
- \(k\)-abelian pattern matching
- \(k\)-spectra of weakly-\(c\)-balanced words
- A faster algorithm computing string edit distances
- A linear space algorithm for computing maximal common subsequences
- A lower bound technique for the size of nondeterministic finite automata
- Absent subsequences in words
- Absent words in a sliding window with applications
- Absoluteness of subword inequality is undecidable
- Algorithms for subsequence combinatorics
- Algorithms on Strings
- Alignment-free sequence comparison using absent words
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Applications of generalized matrix searching to geometric algorithms
- Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!
- Automata and forbidden words
- Bounded repairability of word languages
- Characterization of a word by its subwords
- Complexity of universality and related problems for partially ordered NFAs
- Computing DAWGs and minimal absent words in linear time for integer alphabets
- Computing runs on a general alphabet
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
- Connections between subwords and certain matrix mappings
- Descriptional and computational complexity of finite automata -- a survey
- Directed acyclic subsequence graph -- overview
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- Edit distance for pushdown automata
- Efficient range searching for categorical and plain data
- Episturmian words and some constructions of de Luca and Rauzy
- Error detecting and error correcting codes
- Existential length universality
- Faster longest common extension queries in strings over general alphabets
- Finding a minimum-weight k-link path in graphs with the concave Monge property and applications
- Finding the leftmost critical factorization on unordered alphabet
- Generalized Pascal triangle for binomial coefficients of words
- Geometric applications of a matrix-searching algorithm
- How hard is computing the edit distance?
- scientific article; zbMATH DE number 5485435 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1962790 (Why is no real title available?)
- scientific article; zbMATH DE number 2051146 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 910897 (Why is no real title available?)
- scientific article; zbMATH DE number 7297889 (Why is no real title available?)
- scientific article; zbMATH DE number 7056230 (Why is no real title available?)
- scientific article; zbMATH DE number 6297698 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- scientific article; zbMATH DE number 7651098 (Why is no real title available?)
- scientific article; zbMATH DE number 7695995 (Why is no real title available?)
- Introduction to algorithms.
- Languages ordered by the subword order
- Linear-space computation of the edit-distance between a string and a finite automaton
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- Multivariate fine-grained complexity of longest common subsequence
- Near-optimal range reporting structures for categorical data
- On extended special factors of a word
- On highly palindromic words
- On the complexity of computations under varying sets of primitives
- On the index of Simon's congruence for piecewise testability
- On universal partial words
- Order- n correction for regular languages
- Patterns in permutations and words.
- Preserving order in a forest in less than logarithmic time and linear space
- Reconstructing words from subwords in linear time
- Rich, Sturmian, and trapezoidal words
- Scattered Factor-Universality of Words
- Searching subsequences
- Sketching, streaming, and fine-grained complexity of (weighted) LCS
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Subword histories and Parikh matrices
- Testing Simon's congruence
- The complexity of downward closure comparisons
- The Complexity of Some Problems on Subsequences and Supersequences
- The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
- The edit-distance between a regular language and a context-free language
- The height of piecewise-testable languages with applications in logical complexity
- The level ancestor problem simplified
- The pseudopalindromic completion of regular languages
- The relative edit-distance between two input-driven languages
- The String-to-String Correction Problem
- The subtrace order and counting first-order logic
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- Universal partial words over non-binary alphabets
- Using minimal absent words to build phylogeny
- Watson-Crick palindromes in DNA computing
- Wavelet trees meet suffix trees
- Word assembly through minimal forbidden words
- Words and forbidden factors
Cited in
(5)
This page was built for publication: Absent Subsequences in Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6070611)
