Enumeration of maximal common subsequences between two strings
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- A fast algorithm for computing longest common subsequences
- A faster algorithm computing string edit distances
- Algorithms for the Longest Common Subsequence Problem
- Computing a longest common subsequence for a set of strings
- Directed acyclic subsequence graph -- overview
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
- Maximal common subsequence algorithms
- Maximal common subsequence algorithms
- Maximal common subsequences and minimal common supersequences
- On the complexity of k-SAT
- On the enumeration of minimal dominating sets and related notions
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- The String-to-String Correction Problem
Cited in
(11)- Efficient algorithms for enumerating maximal common subsequences of two strings
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- Maximal Words in Sequence Comparisons Based on Subword Composition
- scientific article; zbMATH DE number 3900178 (Why is no real title available?)
- Maximal common subsequence algorithms
- Maximal common subsequence algorithms
- Tight bounds for the number of absent subsequences
- McDag: indexing maximal common subsequences in practice
- Twenty similarity functions for two finite sequences
- Polynomial-delay enumeration of maximal common subsequences
- Chaining of maximal exact matches in graphs
This page was built for publication: Enumeration of maximal common subsequences between two strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118209)
