Gonzalo Navarro

Karina Figueroa

Proceedings of the MICAI 2005: Advances in Artificial Intelligence, 2005

Space-Efficient Construction of LZ-Index.

[BibT_eX]

[DOI]

Diego Arroyuelo

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

A spatio-temporal access method based on snapshots and events.

[BibT_eX]

[DOI]

Gilberto A. Gutiérrez

M. Andrea Rodríguez

Alejandro F. González

José Orellana

Proceedings of the 13th ACM International Workshop on Geographic Information Systems, 2005

Compressing Dynamic Text Collections via Phrase-Based Coding.

[BibT_eX]

[DOI]

Proceedings of the Research and Advanced Technology for Digital Libraries, 2005

Combining Structural and Textual Contexts for Compressing Semistructured Databases.

[BibT_eX]

[DOI]

Proceedings of the Sixth Mexican International Conference on Computer Science (ENC 2005), 2005

Approximate Searching on Compressed Text.

[BibT_eX]

[DOI]

Carlos Avendaño Pérez

Claudia Feregrino Uribe

Proceedings of the 15th International Conference on Electronics, Communications, and Computers (CONIELECOMP 2005), 28 February 2005, 2005

Text Databases.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Technologies and Applications, 2005

Metric Databases.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Technologies and Applications, 2005

2004

Average complexity of exact and approximate multiple string matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Approximate Regular Expression Searching with Arbitrary Integer Weights.

[BibT_eX]

Nord. J. Comput., 2004

Average-optimal single and multiple approximate string matching.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2004

Practical and flexible pattern matching over Ziv-Lempel compressed text.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

Indexing text using the Ziv-Lempel trie.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

Probabilistic proximity searching algorithms based on compact partitions.

[BibT_eX]

[DOI]

Benjamin Bustos

J. Discrete Algorithms, 2004

Increased Bit-Parallelism for Approximate String Matching.

[BibT_eX]

[DOI]

Heikki Hyyrö

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

Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS.

[BibT_eX]

[DOI]

Kjell Lemström

Yoan J. Pinzón

Proceedings of the String Processing and Information Retrieval, 2004

First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index.

[BibT_eX]

[DOI]

Szymon Grabowski

Proceedings of the String Processing and Information Retrieval, 2004

An Alphabet-Friendly FM-Index.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2004

Simple, Fast, and Efficient Natural Language Adaptive Compression..

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2004

Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays.

[BibT_eX]

[DOI]

Kunihiko Sadakane

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Lempel-Ziv Compression of Structured Text.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

Merging Prediction by Partial Matching with Structural Contexts Model.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

Compressed Compact Suffix Arrays.

[BibT_eX]

[DOI]

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

Improved Single and Multiple Approximate String Matching.

[BibT_eX]

[DOI]

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

On NFA Reductions.

[BibT_eX]

[DOI]

Lucian Ilie

Sheng Yu

Proceedings of the Theory Is Forever, 2004

2003

Optimal binary search trees with costs depending on the access paths.

[BibT_eX]

[DOI]

Jayme Luiz Szwarcfiter

Joísa de S. Oliveira

Walter Cunto

Theor. Comput. Sci., 2003

Pivot selection techniques for proximity searching in metric spaces.

[BibT_eX]

[DOI]

Benjamin Bustos

Pattern Recognit. Lett., 2003

Regular expression searching on compressed text.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2003

Approximate string matching on Ziv-Lempel compressed text.

[BibT_eX]

[DOI]

Juha Kärkkäinen

J. Discrete Algorithms, 2003

Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching.

[BibT_eX]

[DOI]

J. Comput. Biol., 2003

Matchsimile: a Flexible Approximate Matching Tool for Searching Proper Name.

[BibT_eX]

[DOI]

João Marcelo Azevedo Arcoverde

J. Assoc. Inf. Sci. Technol., 2003

Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Fast Multipattern Search Algorithms for Intrusion Detection.

[BibT_eX]

[DOI]

Josué Kuri

Ludovic Mé

Fundam. Informaticae, 2003

Approximate Matching of Run-Length Compressed Strings.

[BibT_eX]

[DOI]

Algorithmica, 2003

Matching Numeric Strings under Noise.

[BibT_eX]

[DOI]

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

Algorithms for Transposition Invariant String Matching.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Distributed Query Processing Using Suffix Arrays.

[BibT_eX]

[DOI]

Mauricio Marín

Proceedings of the String Processing and Information Retrieval, 2003

Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval.

[BibT_eX]

[DOI]

Kjell Lemström

Proceedings of the String Processing and Information Retrieval, 2003

A Practical Index for Genome Searching.

[BibT_eX]

[DOI]

Heikki Hyyrö

Proceedings of the String Processing and Information Retrieval, 2003

A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2003

(S, C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2003

Memory-Adaptive Dynamic Spatial Approximation Trees.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2003

SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2003

Improved Deletions in Dynamic Spatial Approximation Trees.

[BibT_eX]

[DOI]

Nora Reyes

Proceedings of the 23rd International Conference of the Chilean Computer Science Society (SCCC 2003), 2003

Codificación (s, c)-Densa: optimizando la compresión de texto en lenguaje natural.

[BibT_eX]

Proceedings of the VIII Jornadas Ingeniería del Software y Bases de Datos (JISBD 2003), 2003

Usando técnicas de compresión de textos en bibliotecas digitales.

[BibT_eX]

Proceedings of the IV Jornadas de Bibliotecas Digitales, 2003

Suffix Arrays in Parallel.

[BibT_eX]

[DOI]

Mauricio Marín

Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Current Challenges in Textual Databases.

[BibT_eX]

[DOI]

Proceedings of the 4th Mexican International Conference on Computer Science (ENC 2003), 2003

An Efficient Compression Code for Text Databases.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information Retrieval, 2003

Compressing Semistructured Text Databases.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information Retrieval, 2003

Average-Optimal Multiple Approximate String Matching.

[BibT_eX]

[DOI]

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

Practical Constraction of Metric t-Spanners.

[BibT_eX]

Rodrigo Paredes

Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

Clustering in Metric Spaces with Applications to Information Retrieval.

[BibT_eX]

Proceedings of the Clustering and Information Retrieval, 2003

2002

Searching in metric spaces by spatial approximation.

[BibT_eX]

[DOI]

VLDB J., 2002

New and faster filters for multiple approximate string matching.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

XQL and proximal nodes.

[BibT_eX]

[DOI]

J. Assoc. Inf. Sci. Technol., 2002

Fully Dynamic Spatial Approximation Trees.

[BibT_eX]

[DOI]

Nora Reyes

Proceedings of the String Processing and Information Retrieval, 2002

t-Spanners as a Data Structure for Metric Space Searching.

[BibT_eX]

[DOI]

Rodrigo Paredes

Proceedings of the String Processing and Information Retrieval, 2002

Improved Antidictionary Based Compression.

[BibT_eX]

[DOI]

Maxime Crochemore

Proceedings of the 22nd International Conference of the Chilean Computer Science Society (SCCC 2002), 2002

Faster Bit-Parallel Approximate String Matching.

[BibT_eX]

[DOI]

Heikki Hyyrö

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 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

Flexible pattern matching in strings - practical on-line search algorithms for texts and biological sequences.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-521-81307-5, 2002

2001

NR-grep: a fast and flexible pattern-matching tool.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2001

Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching.

[BibT_eX]

[DOI]

José L. Marroquín

Multim. Tools Appl., 2001

Indexing Methods for Approximate String Matching.

[BibT_eX]

[DOI]

Erkki Sutinen

Jorma Tarhio

IEEE Data Eng. Bull., 2001

A guided tour to approximate string matching.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2001

Searching in metric spaces.

[BibT_eX]

[DOI]

José L. Marroquín

ACM Comput. Surv., 2001

Improving an Algorithm for Approximate Pattern Matching.

[BibT_eX]

[DOI]

Algorithmica, 2001

Compact DFA Representation for Fast Regular Expression Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 2001

Matchsimile: A Flexible Approximate Matching Tool for Personal Names Searching.

[BibT_eX]

João Marcelo Azevedo Arcoverde

Proceedings of the XVI Simpósio Brasileiro de Banco de Dados, 2001

Fast and simple character classes and bounded gaps pattern matching, with application to protein searching.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

Faster Approximate String Matching over Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2001

Regular Expression Searching over Ziv-Lempel Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

A Probabilistic Spell for the Curse of Dimensionality.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000

Fast and flexible word searching on compressed text.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2000

Improved approximate pattern matching on hypertext.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2000

Block addressing indices for approximate text retrieval.

[BibT_eX]

[DOI]

J. Am. Soc. Inf. Sci., 2000

Adding Compression to Block Addressing Inverted Indexes.

[BibT_eX]

[DOI]

Marden S. Neubert

Inf. Retr., 2000

Compression: A Key for Next-Generation Text Retrieval Systems.

[BibT_eX]

[DOI]

Computer, 2000

Binary Searching with Nonuniform Costs and Its Application to Text Retrieval.

[BibT_eX]

[DOI]

Eduardo F. Barbosa

Walter Cunto

Algorithmica, 2000

Fast Multipattern Search Algorithms for Intrusion Detection.

[BibT_eX]

[DOI]

Josué Kuri

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

An Effective Clustering Algorithm to Index High Dimensional Metric Spaces.

[BibT_eX]

[DOI]

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

A Pattern Matching Based Filter for Audit Reduction and Fast Detection of Potential Intrusions.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Intrusion Detection, Third International Workshop, 2000

Tessellations of Cuboids with Steiner Points.

[BibT_eX]

[DOI]

Nancy Hitschfeld

Rodrigo Farías

Proceedings of the 9th International Meshing Roundtable, 2000

An Index for Two Dimensional String Matching Allowing Rotations.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

Boyer-Moore String Matching over Ziv-Lempel Compressed Text.

[BibT_eX]

[DOI]

Jorma Tarhio

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Indexing Text with Approximate q-Grams.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Approximate String Matching over Ziv-Lempel Compressed Text.

[BibT_eX]

[DOI]

Juha Kärkkäinen

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999

Bounding the Expected Length of Longest Common Subsequences and Forests.

[BibT_eX]

[DOI]

Ricard Gavaldà

Rodrigo Scheihing

Theory Comput. Syst., 1999

Very Fast and Simple Approximate String Matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Faster Approximate String Matching.

[BibT_eX]

[DOI]

Algorithmica, 1999

Fast Regular Expression Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 1999

Linear Time Sorting of Skewed Distributions.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

A Fast Distributed Suffix Array Generation Algorithm.

[BibT_eX]

[DOI]

Joao Paulo Kitajima

Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

Fast Multi-dimensional Approximate Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

A New Indexing Method for Approximate String Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998

A Practical q -Gram Index for Text Retrieval Allowing Errors.

[BibT_eX]

[DOI]

CLEI Electron. J., 1998

Direct Pattern Matching on Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998

A Model and a Visual Query Language for Structured Text.

[BibT_eX]

[DOI]

Jesús Vegas

Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998

Fast Approximate String Matching in a Dictionary.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998

Fast Searching on Compressed Text Allowing Errors.

[BibT_eX]

[DOI]

Proceedings of the SIGIR '98: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1998

Parallel Generation of Inverted Files for Distributed Text Collections.

[BibT_eX]

[DOI]

Berthier A. Ribeiro-Neto

Joao Paulo Kitajima

Cláudio R. G. Sant'Ana