On pattern matching with \(k\) mismatches and few don't cares
From MaRDI portal
Publication:344551
DOI10.1016/j.ipl.2016.10.003zbMath1392.68447arXiv1602.00621WikidataQ47795650 ScholiaQ47795650MaRDI QIDQ344551
Sanguthevar Rajasekaran, Marius Nicolae
Publication date: 23 November 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.00621
algorithms; \(k\) mismatches with don't cares in the pattern; \(k\) mismatches with wild cards; pattern matching with \(k\) mismatches and don't cares
68W32: Algorithms on strings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient string-matching allowing for non-overlapping inversions
- Mismatch sampling
- Simple deterministic wildcard matching
- Pattern matching with don't cares and few errors
- On string matching with mismatches
- Improved Sketching of Hamming Distance with Error Correcting
- A Black Box for Online Approximate Pattern Matching
- k-Mismatch with Don’t Cares
- Fast Convolutions and Their Applications in Approximate String Matching
- Generalized String Matching
- On Finding Lowest Common Ancestors in Trees
- Fast Pattern Matching in Strings
- Faster algorithms for string matching with k mismatches
- Exact and Approximate Pattern Matching in the Streaming Model