Approximate parameterized matching
From MaRDI portal
Publication:3580940
DOI10.1145/1273340.1273345zbMath1192.68828OpenAlexW2028744820MaRDI QIDQ3580940
Carmit Hazay, Dina Sokol, Moshe Lewenstein
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
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)
Related Items
Order-preserving pattern matching with \(k\) mismatches, Permuted function matching, Weighted approximate parameterized string matching, On the Longest Common Parameterized Subsequence, The set of parameterized \(k\)-covers problem, A Filtering Technique for All Pairs Approximate Parameterized String Matching, Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams, Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications, A prefix array for parameterized strings, Parameterized searching with mismatches for run-length encoded strings, Counting Parameterized Border Arrays for a Binary Alphabet, A brief history of parameterized matching problems, Circular pattern matching with \(k\) mismatches, On the longest common parameterized subsequence
