Common subsequence automaton
From MaRDI portal
Recommendations
- The longest common subsequence problem -- a finite automata approach
- Palindromic subsequence automata and longest common palindromic subsequence
- Automata and automatic sequences
- The size of subsequence automaton
- Convergent sequences of automata
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Chain automata
Cited in
(25)- Directed acyclic subsequence graph -- overview
- The size of subsequence automaton
- Absent subsequences in words
- Constrained sequence analysis algorithms in computational biology
- Finding Common Motifs with Gaps Using Finite Automata
- The size of subsequence automaton.
- Absent Subsequences in Words
- Ranking and Unranking k-Subsequence Universal Words
- Longest Common Subsequence with Gap Constraints
- Subsequences in bounded ranges: matching and analysis problems
- Combinatorial algorithms for subsequence matching: a survey
- Matching patterns with variables under Simon's congruence
- McDag: indexing maximal common subsequences in practice
- k-universality of regular languages
- k-universality of regular languages revisited
- The edit distance to k-subsequence universality
- A compact DAG for storing and searching maximal common subsequences
- \(k\)-universality of regular languages
- Longest common subsequence with gap constraints
- The edit distance to \(k\)-subsequence universality
- Efficiently testing Simon's congruence
- On strings having the same length-k substrings
- Subsequence matching and analysis problems for formal languages
- Subsequence matching and analysis problems for formal languages
- Finite automata based algorithms on subsequences and supersequences of degenerate strings
This page was built for publication: Common subsequence automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418625)
