Recommendations
Cited in
(25)- Parameterized searching with mismatches for run-length encoded strings
- Parameterized matching with mismatches
- The set of parameterized k-covers problem
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- Sublinear Algorithms for Parameterized Matching
- Parameterized matching on non-linear structures
- On the longest common parameterized subsequence
- Parameterized algorithms and kernels for almost induced matching
- A filtering technique for all pairs approximate parameterized string matching
- Order-preserving pattern matching with \(k\) mismatches
- Combinatorial Pattern Matching
- Weighted approximate parameterized string matching
- Two-dimensional parameterized matching
- On the complexity of indeterminate strings matching
- Fast parameterized matching with \(q\)-grams
- Almost fully-parallel parentheses matching
- Permuted function matching
- Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications
- Counting Parameterized Border Arrays for a Binary Alphabet
- Circular pattern matching with \(k\) mismatches
- A brief history of parameterized matching problems
- On the Longest Common Parameterized Subsequence
- A prefix array for parameterized strings
- Generalized coarse matching
- Algorithms – ESA 2004
This page was built for publication: Approximate parameterized matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580940)
