Pages that link to "Item:Q1736652"
From MaRDI portal
The following pages link to On string matching with mismatches (Q1736652):
Displaying 17 items.
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- Mismatch sampling (Q418198) (← links)
- String matching with lookahead (Q496556) (← links)
- On approximate pattern matching with thresholds (Q522963) (← links)
- Fast algorithms for approximately counting mismatches (Q1313761) (← links)
- Three one-way heads cannot do string matching (Q1318467) (← links)
- Matching a set of strings with variable length don't cares (Q1391531) (← links)
- Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
- Longest common extension (Q1678103) (← links)
- Pattern matching in the Hamming distance with thresholds (Q1944111) (← links)
- Matchstick puzzles on a grid (Q2308506) (← links)
- String matching with simple devices (Q2380036) (← links)
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069) (← links)
- Generalized String Matching (Q3790661) (← links)
- Two-way string-matching (Q4302850) (← links)
- (Q4347164) (← links)
- Inverse Pattern Matching (Q4360135) (← links)