| Publication | Date of Publication | Type |
|---|
Suffix arrays with a twist
Computing and Informatics | 2023-02-16 | Paper |
On building minimal automaton for subset matching queries
Information Processing Letters | 2017-11-03 | Paper |
Motif matching using gapped patterns
Theoretical Computer Science | 2014-08-27 | Paper |
On a compact encoding of the swap automaton
Information Processing Letters | 2014-04-17 | Paper |
Approximate pattern matching with \(k\)-mismatches in packed text
Information Processing Letters | 2014-04-14 | Paper |
Succinct backward-DAWG-matching
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Motif matching using gapped patterns
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
European Journal of Combinatorics | 2012-11-15 | Paper |
From nondeterministic suffix automaton to lazy suffix tree
Algorithms and Applications | 2010-05-04 | Paper |
Average-optimal multiple approximate string matching
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
Information Processing Letters | 2010-03-24 | Paper |
Processing of Huffman compressed texts with a super-alphabet.
Lecture Notes in Computer Science | 2010-02-09 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2010-02-09 | Paper |
Efficient parameterized string matching
Information Processing Letters | 2010-01-29 | Paper |
A general compression algorithm that supports fast searching
Information Processing Letters | 2010-01-29 | Paper |
Fast convolutions and their applications in approximate string matching
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Average-optimal string matching
Journal of Discrete Algorithms | 2009-12-10 | Paper |
Exploiting distance coherence to speed up range queries in metric indexes
Information Processing Letters | 2009-12-04 | Paper |
Simple Random Access Compression
Fundamenta Informaticae | 2009-06-30 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Shift-or string matching with super-alphabets
Information Processing Letters | 2009-04-28 | Paper |
Nested Counters in Bit-Parallel String Matching
Language and Automata Theory and Applications | 2009-04-02 | Paper |
EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, kΔ, α)-MATCHING
International Journal of Foundations of Computer Science | 2008-11-03 | Paper |
Increased bit-parallelism for approximate and multiple string matching
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Simple Compression Code Supporting Random Access and Fast String Matching
Experimental Algorithms | 2008-01-02 | Paper |
Simple Space-Time Trade-Offs for AESA
Experimental Algorithms | 2008-01-02 | Paper |
Efficient Bit-Parallel Algorithms for (δ,α)-Matching
Experimental Algorithms | 2007-09-14 | Paper |
Rotation and lighting invariant template matching
Information and Computation | 2007-07-16 | Paper |
FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
| On-line approximate string matching in natural language | 2006-09-18 | Paper |
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
Theoretical Computer Science | 2005-12-29 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Average-optimal single and multiple approximate string matching
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
| scientific article; zbMATH DE number 2140438 (Why is no real title available?) | 2005-03-03 | Paper |
Average complexity of exact and approximate multiple string matching
Theoretical Computer Science | 2004-11-12 | Paper |
| scientific article; zbMATH DE number 2087057 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1759461 (Why is no real title available?) | 2002-11-25 | Paper |
