Pages that link to "Item:Q3579248"
From MaRDI portal
The following pages link to Verifying candidate matches in sparse and wildcard matching (Q3579248):
Displaying 36 items.
- Set intersection and sequence matching with mismatch counting (Q294918) (← links)
- Algorithms for path-constrained sequence alignment (Q396718) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- Simple deterministic wildcard matching (Q845893) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- Finding submasses in weighted strings with fast Fourier transform (Q876468) (← links)
- Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time (Q959798) (← links)
- Matching with don't-cares and a small number of mismatches (Q976093) (← links)
- Faster pattern matching with character classes using prime number encoding (Q1004281) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- Permuted function matching (Q1675783) (← links)
- A filtering algorithm for \(k\)-mismatch with don't cares (Q1675785) (← links)
- Pattern matching with wildcards using words of shorter length (Q1675874) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- String matching with up to \(k\) swaps and mismatches (Q1959438) (← links)
- Polynomial modular product verification and its implications (Q2100047) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Motif patterns in 2D (Q2474071) (← links)
- On minimizing pattern splitting in multi-track string matching (Q2569400) (← links)
- On the average-case complexity of pattern matching with wildcards (Q2672571) (← links)
- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees (Q3183485) (← links)
- Upper and Lower Bounds for Dynamic Data Structures on Strings (Q3304117) (← links)
- Approximate String Matching with Address Bit Errors (Q3506947) (← links)
- A Black Box for Online Approximate Pattern Matching (Q3506949) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- (Q5091170) (← links)
- Fast Convolutions of Packed Strings and Pattern Matching with Wildcards (Q5268397) (← links)
- Multi-pattern matching algorithm with wildcards based on bit-parallelism (Q5371909) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- (Q5874553) (← links)
- Periodicity in data streams with wildcards (Q5915573) (← links)
