Efficiently finding all shortest absent subsequences in a string
From MaRDI portal
Cites work
- \(k\)-universality of regular languages
- Absent subsequences in words
- Absent Subsequences in Words
- Alignment-free sequence comparison using absent words
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- An approach to software system modelling and analysis
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Combinatorial algorithms for subsequence matching: a survey
- Computing DAWGs and minimal absent words in linear time for integer alphabets
- Connections between subwords and certain matrix mappings
- Discovering event queries from traces: laying foundations for subsequence-queries with wildcards and gap-size constraints
- Efficiently testing Simon's congruence
- Enumerating \(m\)-length walks in directed graphs with constant delay
- Enumerating regular languages with bounded delay
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 2051146 (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 7695992 (Why is no real title available?)
- scientific article; zbMATH DE number 7695995 (Why is no real title available?)
- Multivariate fine-grained complexity of longest common subsequence
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- On computing the length of longest increasing subsequences
- On problems related to absent subsequences
- Patterns in permutations and words.
- Scattered Factor-Universality of Words
- Software Descriptions with Flow Expressions
- String matching with variable length gaps
- Subsequence matching and analysis problems for formal languages
- The complexity of downward closure comparisons
- The edit distance to \(k\)-subsequence universality
- The pairing heap: A new form of self-adjusting heap
- The surprising mathematics of longest increasing subsequences
- Tight bounds for the number of absent subsequences
- Tight hardness results for LCS and other sequence similarity measures
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
This page was built for publication: Efficiently finding all shortest absent subsequences in a string
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411980)
