The following pages link to (Q4633890):
Displaying 16 items.
- Set intersection and sequence matching with mismatch counting (Q294918) (← links)
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- Mismatch sampling (Q418198) (← links)
- A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- On string matching with mismatches (Q1736652) (← links)
- Streaming pattern matching with \(d\) wildcards (Q1741859) (← links)
- Efficient sampling of non-strict turnstile data streams (Q2348042) (← links)
- Approximate pattern matching with \(k\)-mismatches in packed text (Q2445229) (← links)
- On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling (Q2942241) (← links)
- (Q5002646) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- Verifiable Stream Computation and Arthur--Merlin Communication (Q5232326) (← links)
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) (← links)
- Periodicity in data streams with wildcards (Q5915573) (← links)
- (Q6062160) (← links)
