The following pages link to Jorma Tarhio (Q414444):
Displaying 34 items.
- String matching with alphabet sampling (Q414445) (← links)
- String matching with lookahead (Q496556) (← links)
- A filtration method for order-preserving matching (Q894438) (← links)
- Uncle-attributed grammars (Q911316) (← links)
- Improving practical exact string matching (Q990135) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- A greedy approximation algorithm for constructing shortest common superstrings (Q1102756) (← links)
- Looping LR parsers (Q1108813) (← links)
- Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
- Lyndon factorization algorithms for small alphabets and run-length encoded strings (Q2004905) (← links)
- Improved online algorithms for jumbled matching (Q2295624) (← links)
- Indexing text with approximate \(q\)-grams (Q2569395) (← links)
- (Q2723949) (← links)
- (Q2723965) (← links)
- Indexed Multi-pattern Matching (Q2894483) (← links)
- (Q3484343) (← links)
- On String Matching in Chunked Texts (Q3503903) (← links)
- Multipattern string matching with <i>q</i> -grams (Q3507759) (← links)
- Tuning String Matching for Huge Pattern Sets (Q3550837) (← links)
- Approximate String Matching with Reduced Alphabet (Q3558273) (← links)
- Approximate Boyer–Moore String Matching (Q4032935) (← links)
- (Q4471633) (← links)
- (Q4471656) (← links)
- Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948) (← links)
- (Q4654274) (← links)
- (Q4661875) (← links)
- (Q4725747) (← links)
- (Q4737688) (← links)
- (Q4825538) (← links)
- Boyer-Moore approach to approximate string matching (Q5056116) (← links)
- Tuning BNDM with<i>q</i>-Grams (Q5233563) (← links)
- Sublinear Algorithms for Parameterized Matching (Q5307519) (← links)
- String Processing and Information Retrieval (Q5897133) (← links)
- String Processing and Information Retrieval (Q5897135) (← links)
