Verifying candidate matches in sparse and wildcard matching
From MaRDI portal
(Redirected from Publication:3579248)
Cited in
(40)- Faster pattern matching with character classes using prime number encoding
- Approximate string matching with address bit errors
- Permuted function matching
- A filtering algorithm for k-mismatch with don't cares
- Pattern matching with wildcards using words of shorter length
- Streaming pattern matching with \(d\) wildcards
- String matching with up to k swaps and mismatches
- Polynomial modular product verification and its implications
- Motif patterns in 2D
- On minimizing pattern splitting in multi-track string matching
- On the average-case complexity of pattern matching with wildcards
- Set intersection and sequence matching with mismatch counting
- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
- Upper and lower bounds for dynamic data structures on strings
- Approximate String Matching with Address Bit Errors
- A Black Box for Online Approximate Pattern Matching
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
- Algorithms for path-constrained sequence alignment
- An algorithmic toolbox for periodic partial words
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- Even faster elastic-degenerate string matching via fast matrix multiplication
- Necklaces, convolutions, and \(X+Y\)
- Fast convolutions of packed strings and pattern matching with wildcards
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
- Multi-pattern matching algorithm with wildcards based on bit-parallelism
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
- scientific article; zbMATH DE number 7651219 (Why is no real title available?)
- Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics
- Removing additive structure in 3SUM-based reductions
- A unifying taxonomy of pattern matching in degenerate strings and founder graphs
- Fast interpolation and multiplication of unbalanced polynomials
- A black box for online approximate pattern matching
- Fast n-fold Boolean convolution via additive combinatorics
- Longest common extensions with wildcards: trade-off and applications
- Pattern matching with mismatches and wildcards
- Simple deterministic wildcard matching
- Pattern matching with don't cares and few errors
- Finding submasses in weighted strings with fast Fourier transform
- Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
- Matching with don't-cares and a small number of mismatches
This page was built for publication: Verifying candidate matches in sparse and wildcard matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579248)
