scientific article; zbMATH DE number 2119723
From MaRDI portal
Publication:4828997
zbMath1093.68674MaRDI QIDQ4828997
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A matching algorithm in PMWL based on CluTree ⋮ Simple deterministic wildcard matching ⋮ Pattern matching with don't cares and few errors ⋮ Fingerprints in compressed strings ⋮ A filtering algorithm for \(k\)-mismatch with don't cares ⋮ Pattern matching with wildcards using words of shorter length ⋮ Covering problems for partial words and for indeterminate strings ⋮ Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform ⋮ On the average-case complexity of pattern matching with wildcards ⋮ Internal masked prefix sums and its connection to fully internal measurement queries ⋮ A Black Box for Online Approximate Pattern Matching ⋮ Finding patterns and periods in Cartesian tree matching ⋮ Multi-pattern matching algorithm with wildcards based on bit-parallelism ⋮ On string matching with mismatches ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Streaming pattern matching with \(d\) wildcards ⋮ Necklaces, convolutions, and \(X+Y\) ⋮ String indexing for patterns with wildcards ⋮ A black box for online approximate pattern matching ⋮ Periodicity in data streams with wildcards ⋮ Unnamed Item ⋮ Faster pattern matching with character classes using prime number encoding ⋮ Verifiable Stream Computation and Arthur--Merlin Communication ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication ⋮ Faster Evaluation of Subtraction Games
