Kimmo Fredriksson

Comput. Informatics, 2019

Suffix Arrays with a Twist.

[BibT_eX]

[DOI]

Tomasz Marek Kowalski

Comput. Informatics, 2019

2016

Practically efficient array initialization.

[BibT_eX]

[DOI]

Pekka Kilpeläinen

Softw. Pract. Exp., 2016

Suffix arrays with a twist.

[BibT_eX]

[DOI]

Tomasz Marek Kowalski

Marcin Raniszewski

CoRR, 2016

Geometric Near-neighbor Access Tree (GNAT) revisited.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Quicker range- and k-NN joins in metric spaces.

[BibT_eX]

[DOI]

Billy Braithwaite

Inf. Syst., 2015

2014

Motif matching using gapped patterns.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On a compact encoding of the swap automaton.

[BibT_eX]

[DOI]

Emanuele Giaquinta

Inf. Process. Lett., 2014

Multiple Pattern Matching Revisited.

[BibT_eX]

[DOI]

Robert Susik

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

2013

Approximate pattern matching with k-mismatches in packed text.

[BibT_eX]

[DOI]

Emanuele Giaquinta

Inf. Process. Lett., 2013

Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Quicker Similarity Joins in Metric Spaces.

[BibT_eX]

[DOI]

Billy Braithwaite

Proceedings of the Similarity Search and Applications - 6th International Conference, 2013

Motif Matching Using Gapped Patterns.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2010

On building minimal automaton for subset matching queries.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

From Nondeterministic Suffix Automaton to Lazy Suffix Tree.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Applications, 2010

2009

Average-optimal string matching.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

Simple Random Access Compression.

[BibT_eX]

[DOI]

Fedor Nikitin

Fundam. Informaticae, 2009

Speeding Up Permutation Based Indexing with Indexing.

[BibT_eX]

[DOI]

Karina Figueroa

Proceedings of the Second International Workshop on Similarity Search and Applications, 2009

Nested Counters in Bit-Parallel String Matching.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

Fast Convolutions and Their Applications in Approximate String Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Succinct backward-DAWG-matching.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2008

Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance.

[BibT_eX]

[DOI]

Inf. Retr., 2008

Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Efficient Algorithms for (delta, gamma, alpha) and (delta, kDelta, alpha)-Matching.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

2007

Engineering efficient metric indexes.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2007

Simple Compression Code Supporting Random Access and Fast String Matching.

[BibT_eX]

[DOI]

Fedor Nikitin

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Simple Space-Time Trade-Offs for AESA.

[BibT_eX]

[DOI]

Karina Figueroa

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

2006

Efficient parameterized string matching.

[BibT_eX]

[DOI]

Maxim Mozgovoy

Inf. Process. Lett., 2006

A general compression algorithm that supports fast searching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

On-line Approximate String Matching in Natural Language.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

Efficient algorithms for (delta, gamma, alpha)-matching.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference, 2006

Efficient Algorithms for Pattern Matching with General Gaps and Character Classes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2006

2005

Sequential and indexed two-dimensional combinatorial template matching allowing rotations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Increased bit-parallelism for approximate and multiple string matching.

[BibT_eX]

[DOI]

Heikki Hyyrö

ACM J. Exp. Algorithmics, 2005

Exploiting distance coherence to speed up range queries in metric indexes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Flexible music retrieval in sublinear time.

[BibT_eX]

[DOI]

Veli Mäkinen

Proceedings of the Prague Stringology Conference, 2005

Fast Plagiarism Detection System.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2005

Practical and Optimal String Matching.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2005

2004

Average complexity of exact and approximate multiple string matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Average-optimal single and multiple approximate string matching.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2004

Efficient String Matching in Huffman Compressed Texts.

[BibT_eX]

[DOI]

Jorma Tarhio

Fundam. Informaticae, 2004

Increased Bit-Parallelism for Approximate String Matching.

[BibT_eX]

[DOI]

Heikki Hyyrö

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Metric Indexes for Approximate String Matching in a Dictionary.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2004

Rotation and Lighting Invariant Template Matching.

[BibT_eX]

[DOI]

Veli Mäkinen

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Improved Single and Multiple Approximate String Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Symposium on 3D Data Processing, 2004

2003

Shift-or string matching with super-alphabets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Processing of Huffman Compressed Texts with a Super-Alphabet.

[BibT_eX]

[DOI]

Jorma Tarhio

Proceedings of the String Processing and Information Retrieval, 2003

Row-wise Tiling for the Myers' Bit-Parallel Approximate String Matching Algorithm.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2003

Average-Optimal Multiple Approximate String Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002

Faster String Matching with Super-Alphabets.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2002

Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

Faster template matching without FFT.

[BibT_eX]

[DOI]

Proceedings of the 2001 International Conference on Image Processing, 2001

2000

Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Rotation Invariant Histogram Filters for Similarity and Distance Measures between Digital Images.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

An Index for Two Dimensional String Matching Allowing Rotations.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

1999

Combinatorial methods for approximate image matching under translations and rotations.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1999

1998

A Rotation Invariant Filter for Two-Dimensional String Matching.

[BibT_eX]

[DOI]