Approximate parameterized matching
From MaRDI portal
Publication:3580940
DOI10.1145/1273340.1273345zbMATH Open1192.68828OpenAlexW2028744820MaRDI QIDQ3580940FDOQ3580940
Carmit Hazay, Moshe Lewenstein, Dina Sokol
Publication date: 14 August 2010
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1273340.1273345
Recommendations
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)
Cited In (22)
- Parameterized searching with mismatches for run-length encoded strings
- Parameterized matching with mismatches
- The set of parameterized \(k\)-covers problem
- Sublinear Algorithms for Parameterized Matching
- Parameterized algorithms and kernels for almost induced matching
- On the longest common parameterized subsequence
- Combinatorial Pattern Matching
- Order-preserving pattern matching with \(k\) mismatches
- Weighted approximate parameterized string matching
- Fast parameterized matching with \(q\)-grams
- Almost fully-parallel parentheses matching
- Permuted function matching
- Counting Parameterized Border Arrays for a Binary Alphabet
- Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications
- Circular pattern matching with \(k\) mismatches
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams
- A brief history of parameterized matching problems
- On the Longest Common Parameterized Subsequence
- A prefix array for parameterized strings
- A Filtering Technique for All Pairs Approximate Parameterized String Matching
- Algorithms – ESA 2004
- Generalized coarse matching
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)
