The following pages link to k-Mismatch with Don’t Cares (Q3527207):
Displaying 9 items.
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- Mismatch sampling (Q418198) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) (← links)
- Matching with don't-cares and a small number of mismatches (Q976093) (← links)
- On string matching with mismatches (Q1736652) (← links)
- On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling (Q2942241) (← links)
- A Black Box for Online Approximate Pattern Matching (Q3506949) (← links)
