Simple deterministic wildcard matching
From MaRDI portal
Publication:845893
DOI10.1016/j.ipl.2006.08.002zbMath1185.68830OpenAlexW2067386559MaRDI QIDQ845893
Raphaël Clifford, Peter Clifford
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.08.002
Related Items (34)
Set intersection and sequence matching with mismatch counting ⋮ Pattern matching with don't cares and few errors ⋮ On pattern matching with \(k\) mismatches and few don't cares ⋮ A filtering algorithm for \(k\)-mismatch with don't cares ⋮ Pattern matching with wildcards using words of shorter length ⋮ On the complexity of deciding avoidability of sets of partial words ⋮ Covering problems for partial words and for indeterminate strings ⋮ Upper and Lower Bounds for Dynamic Data Structures on Strings ⋮ On the average-case complexity of pattern matching with wildcards ⋮ A Black Box for Online Approximate Pattern Matching ⋮ A new efficient indexing algorithm for one-dimensional real scaled patterns ⋮ The indexing for one-dimensional proportionally-scaled strings ⋮ Multi-pattern matching algorithm with wildcards based on bit-parallelism ⋮ Unnamed Item ⋮ An algorithmic toolbox for periodic partial words ⋮ On string matching with mismatches ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Streaming pattern matching with \(d\) wildcards ⋮ Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform ⋮ Necklaces, convolutions, and \(X+Y\) ⋮ Verifiable pattern matching on outsourced texts ⋮ String indexing for patterns with wildcards ⋮ Matching with don't-cares and a small number of mismatches ⋮ A black box for online approximate pattern matching ⋮ Periodicity in data streams with wildcards ⋮ Unnamed Item ⋮ Hardness of comparing two run-length encoded strings ⋮ Faster pattern matching with character classes using prime number encoding ⋮ Longest common substring made fully dynamic ⋮ Hamming Distance Completeness ⋮ Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard ⋮ A faster algorithm for the computation of string convolutions using LZ78 parsing ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication ⋮ Fast Convolutions of Packed Strings and Pattern Matching with Wildcards
Cites Work
This page was built for publication: Simple deterministic wildcard matching
