Simple deterministic wildcard matching
From MaRDI portal
Publication:845893
DOI10.1016/J.IPL.2006.08.002zbMATH Open1185.68830OpenAlexW2067386559MaRDI QIDQ845893FDOQ845893
Authors: Peter Clifford, Raphaël 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
Recommendations
- Pattern matching with arbitrary-length wildcards
- Pattern matching with wildcards using words of shorter length
- scientific article; zbMATH DE number 1497852
- Simple Optimal String Matching Algorithm
- Pattern matching with wildcards and length constraints using maximum network flow
- String indexing for patterns with wildcards
- String indexing for patterns with wildcards
- Streaming pattern matching with \(d\) wildcards
Cites Work
Cited In (38)
- Title not available (Why is that?)
- Fast Convolutions of Packed Strings and Pattern Matching with Wildcards
- On the average-case complexity of pattern matching with wildcards
- Faster pattern matching with character classes using prime number encoding
- A new efficient indexing algorithm for one-dimensional real scaled patterns
- Periodicity in data streams with wildcards
- Upper and Lower Bounds for Dynamic Data Structures on Strings
- A black box for online approximate pattern matching
- Title not available (Why is that?)
- Set intersection and sequence matching with mismatch counting
- Title not available (Why is that?)
- A Black Box for Online Approximate Pattern Matching
- Verifiable pattern matching on outsourced texts
- Pattern matching with wildcards using words of shorter length
- Hardness of comparing two run-length encoded strings
- Streaming pattern matching with \(d\) wildcards
- An algorithmic toolbox for periodic partial words
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
- On the complexity of deciding avoidability of sets of partial words
- The indexing for one-dimensional proportionally-scaled strings
- Hamming Distance Completeness
- Multi-pattern matching algorithm with wildcards based on bit-parallelism
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- A faster algorithm for the computation of string convolutions using LZ78 parsing
- On pattern matching with \(k\) mismatches and few don't cares
- Matching with don't-cares and a small number of mismatches
- A simple obfuscation scheme for pattern-matching with wildcards
- String indexing for patterns with wildcards
- Pattern matching with don't cares and few errors
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
- Approximate subset matching with don't cares
- Title not available (Why is that?)
- Necklaces, convolutions, and \(X+Y\)
- A filtering algorithm for \(k\)-mismatch with don't cares
- On string matching with mismatches
- Covering problems for partial words and for indeterminate strings
- Longest common substring made fully dynamic
This page was built for publication: Simple deterministic wildcard matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845893)
