| Publication | Date of Publication | Type |
|---|
String searching with mismatches using AVX2 and AVX-512 instructions
Information Processing Letters | 2025-03-13 | Paper |
On using q-gram locations in approximate string matching
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Boyer-Moore approach to approximate string matching
SWAT 90 | 2022-12-09 | Paper |
Lyndon factorization algorithms for small alphabets and run-length encoded strings
Algorithms | 2020-10-07 | Paper |
Improved online algorithms for jumbled matching
Discrete Applied Mathematics | 2020-02-14 | Paper |
Tuning BNDM with \(q\)-grams
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches
ACM Journal of Experimental Algorithmics | 2018-08-06 | Paper |
A filtration method for order-preserving matching
Information Processing Letters | 2015-12-01 | Paper |
String matching with lookahead
Discrete Applied Mathematics | 2015-09-22 | Paper |
Indexed multi-pattern matching
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
String matching with alphabet sampling
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Approximate Boyer-Moore string matching for small alphabets
Algorithmica | 2010-09-27 | Paper |
Improving practical exact string matching
Information Processing Letters | 2010-09-02 | Paper |
Approximate string matching with reduced alphabet
Algorithms and Applications | 2010-05-04 | Paper |
Tuning string matching for huge pattern sets
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Alternative algorithms for bit-parallel string matching.
Lecture Notes in Computer Science | 2010-02-09 | Paper |
Processing of Huffman compressed texts with a super-alphabet.
Lecture Notes in Computer Science | 2010-02-09 | Paper |
Fast parameterized matching with \(q\)-grams
Journal of Discrete Algorithms | 2009-05-13 | Paper |
Multipattern string matching with <i>q</i> -grams
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
On String Matching in Chunked Texts
Implementation and Application of Automata | 2008-06-10 | Paper |
Sublinear Algorithms for Parameterized Matching
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Indexing text with approximate \(q\)-grams
Journal of Discrete Algorithms | 2005-10-27 | Paper |
| scientific article; zbMATH DE number 2149348 (Why is no real title available?) | 2005-03-30 | Paper |
| scientific article; zbMATH DE number 2140438 (Why is no real title available?) | 2005-03-03 | Paper |
| scientific article; zbMATH DE number 2111729 (Why is no real title available?) | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2087042 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079616 (Why is no real title available?) | 2004-07-30 | Paper |
| scientific article; zbMATH DE number 2079634 (Why is no real title available?) | 2004-07-30 | Paper |
| scientific article; zbMATH DE number 1615292 (Why is no real title available?) | 2001-07-08 | Paper |
| scientific article; zbMATH DE number 1615279 (Why is no real title available?) | 2001-07-08 | Paper |
Approximate Boyer–Moore String Matching
SIAM Journal on Computing | 1993-05-17 | Paper |
Uncle-attributed grammars
BIT | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4155860 (Why is no real title available?) | 1989-01-01 | Paper |
A greedy approximation algorithm for constructing shortest common superstrings
Theoretical Computer Science | 1988-01-01 | Paper |
Looping LR parsers
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3999290 (Why is no real title available?) | 1986-01-01 | Paper |
