Gonzalo Navarro

According to our database1, Gonzalo Navarro authored at least 395 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Compressed Indexes for Repetitive Textual Datasets.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy.
IEEE Trans. Information Theory, 2019

Universal compressed text indexing.
Theor. Comput. Sci., 2019

Cell cycle and protein complex dynamics in discovering signaling pathways.
J. Bioinformatics and Computational Biology, 2019

GraCT: A Grammar-based Compressed Index for Trajectory Data.
Inf. Sci., 2019

On the reproducibility of experiments of indexing repetitive document collections.
Inf. Syst., 2019

Lempel-Ziv compressed structures for document retrieval.
Inf. Comput., 2019

Space-Efficient Computation of the Burrows-Wheeler Transform.
Proceedings of the Data Compression Conference, 2019

Practical Indexing of Repetitive Collections Using Relative Lempel-Ziv.
Proceedings of the Data Compression Conference, 2019

Dv2v: A Dynamic Variable-to-Variable Compressor.
Proceedings of the Data Compression Conference, 2019

Tunneling on Wheeler Graphs.
Proceedings of the Data Compression Conference, 2019

Simulating the DNA Overlap Graph in Succinct Space.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Text Index Compression.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Managing Compressed Structured Text.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Relative Suffix Trees.
Comput. J., 2018

Guest Editorial: Special Issue on Theoretical Informatics.
Algorithmica, 2018

Guest Editorial: Special Issue on Compact Data Structures.
Algorithmica, 2018

Optimal-Time Text Indexing in BWT-runs Bounded Space.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

On the Approximation Ratio of Lempel-Ziv Parsing.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Tree Path Majority Data Structures.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

A Grammar Compression Algorithm Based on Induced Suffix Sorting.
Proceedings of the 2018 Data Compression Conference, 2018

Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication.
Proceedings of the 2018 Data Compression Conference, 2018

Two-Dimensional Block Trees.
Proceedings of the 2018 Data Compression Conference, 2018

Compact Representations of Event Sequences.
Proceedings of the 2018 Data Compression Conference, 2018

2017
Inverted Treaps.
ACM Trans. Inf. Syst., 2017

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries.
ACM Trans. Algorithms, 2017

Time-Optimal Top-k Document Retrieval.
SIAM J. Comput., 2017

Computation over Compressed Structured Data (NII Shonan Meeting 2017-15).
NII Shonan Meet. Rep., 2017

Practical Compact Indexes for Top-k Document Retrieval.
ACM Journal of Experimental Algorithmics, 2017

Grammar compressed sequences with rank/select support.
J. Discrete Algorithms, 2017

A succinct data structure for self-indexing ternary relations.
J. Discrete Algorithms, 2017

An empirical evaluation of intrinsic dimension estimators.
Inf. Syst., 2017

Compressed representation of dynamic binary relations with applications.
Inf. Syst., 2017

Document retrieval on repetitive string collections.
Inf. Retr. Journal, 2017

Top-k Term-Proximity in Succinct Space.
Algorithmica, 2017

Fast and Compact Planar Embeddings.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

A Self-index on Block Trees.
Proceedings of the String Processing and Information Retrieval, 2017

Efficient Compression and Indexing of Trajectories.
Proceedings of the String Processing and Information Retrieval, 2017

LZ78 Compression in Low Main Memory Space.
Proceedings of the String Processing and Information Retrieval, 2017

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Fast Compressed Self-Indexes with Deterministic Linear-Time Construction.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Compressed Dynamic Range Majority Data Structures.
Proceedings of the 2017 Data Compression Conference, 2017

Document Listing on Repetitive Collections with Guaranteed Performance.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Path Queries on Functions.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
Compressed Tree Representations.
Encyclopedia of Algorithms, 2016

Approximate String Matching.
Encyclopedia of Algorithms, 2016

Approximate Regular Expression Matching.
Encyclopedia of Algorithms, 2016

Compressed Text Indexing.
Encyclopedia of Algorithms, 2016

Simple and efficient fully-functional succinct trees.
Theor. Comput. Sci., 2016

Faster Compressed Suffix Trees for Repetitive Collections.
ACM Journal of Experimental Algorithmics, 2016

New dynamic metric indices for secondary memory.
Inf. Syst., 2016

Practical compressed string dictionaries.
Inf. Syst., 2016

Universal indexes for highly repetitive document collections.
Inf. Syst., 2016

Aggregated 2D range queries on clustered points.
Inf. Syst., 2016

Computation over Compressed Structured Data (Dagstuhl Seminar 16431).
Dagstuhl Reports, 2016

Optimal Encodings for Range Majority Queries.
Algorithmica, 2016

Practical Dynamic Entropy-Compressed Bitvectors with Applications.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes.
Proceedings of the String Processing and Information Retrieval, 2016

GraCT: A Grammar Based Compressed Representation of Trajectories.
Proceedings of the String Processing and Information Retrieval, 2016

Efficient Representation of Multidimensional Data over Hierarchical Domains.
Proceedings of the String Processing and Information Retrieval, 2016

Improved Range Minimum Queries.
Proceedings of the 2016 Data Compression Conference, 2016

Compact Data Structures - A Practical Approach.
Cambridge University Press, ISBN: 978-1-10-715238-0, 2016

2015
Efficient and Compact Representations of Prefix Codes.
IEEE Trans. Information Theory, 2015

Optimal Lower and Upper Bounds for Representing Sequences.
ACM Trans. Algorithms, 2015

Compressed vertical partitioning for efficient RDF management.
Knowl. Inf. Syst., 2015

Bottom-k document retrieval.
J. Discrete Algorithms, 2015

Improved and extended locating functionality on compressed suffix arrays.
J. Discrete Algorithms, 2015

The wavelet matrix: An efficient wavelet tree for large alphabets.
Inf. Syst., 2015

Near neighbor searching with K nearest references.
Inf. Syst., 2015

Parallel family trees for transfer matrices in the Potts model.
Computer Physics Communications, 2015

PcapWT: An efficient packet extraction tool for large volume network traces.
Computer Networks, 2015

A Compact RDF Store Using Suffix Arrays.
Proceedings of the String Processing and Information Retrieval, 2015

An Empirical Evaluation of Intrinsic Dimension Estimators.
Proceedings of the Similarity Search and Applications - 8th International Conference, 2015

Document Counting in Compressed Space.
Proceedings of the 2015 Data Compression Conference, 2015

Faster Compressed Quadtrees.
Proceedings of the 2015 Data Compression Conference, 2015

Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Improved Single-Term Top-k Document Retrieval.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
XXS: Efficient XPath Evaluation on Compressed XML Documents.
ACM Trans. Inf. Syst., 2014

New space/time tradeoffs for top-k document retrieval on sequences.
Theor. Comput. Sci., 2014

Fully Functional Static and Dynamic Succinct Trees.
ACM Trans. Algorithms, 2014

Distributed text search using suffix arrays.
Parallel Computing, 2014

Compressed representations for web and social graphs.
Knowl. Inf. Syst., 2014

General Document Retrieval in Compact Space.
ACM Journal of Experimental Algorithmics, 2014

Locally Compressed Suffix Arrays.
ACM Journal of Experimental Algorithmics, 2014

Editorial.
Inf. Syst., 2014

Compact representation of Web graphs with extended functionality.
Inf. Syst., 2014

Efficient Fully-Compressed Sequence Representations.
Algorithmica, 2014

Faster Compressed Suffix Trees for Repetitive Text Collections.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Improved and Extended Locating Functionality on Compressed Suffix Arrays.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Ranked Document Selection.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Grammar Compressed Sequences with Rank/Select Support.
Proceedings of the String Processing and Information Retrieval, 2014

Efficient Compressed Indexing for Approximate Top-k String Retrieval.
Proceedings of the String Processing and Information Retrieval, 2014

Efficient Indexing and Representation of Web Access Logs.
Proceedings of the String Processing and Information Retrieval, 2014

K 2-Treaps: Range Top-k Queries in Compact Space.
Proceedings of the String Processing and Information Retrieval, 2014

Dynamic List of Clusters in Secondary Memory.
Proceedings of the Similarity Search and Applications - 7th International Conference, 2014

Top- k Term-Proximity in Succinct Space.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Asymptotically Optimal Encodings for Range Selection.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Document Retrieval on Repetitive Collections.
Proceedings of the Algorithms - ESA 2014, 2014

Fast Fully-Compressed Suffix Trees.
Proceedings of the Data Compression Conference, 2014

Interleaved K2-Tree: Indexing and Navigating Ternary Relations.
Proceedings of the Data Compression Conference, 2014

Encodings for Range Majority Queries.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
Space-efficient data-analysis queries on grids.
Theor. Comput. Sci., 2013

On compressing and indexing repetitive sequences.
Theor. Comput. Sci., 2013

Colored range queries and document retrieval.
Theor. Comput. Sci., 2013

On compressing permutations and adaptive sorting.
Theor. Comput. Sci., 2013

Improved compressed indexes for full-text document retrieval.
J. Discrete Algorithms, 2013

Space-efficient representations of rectangle datasets supporting orthogonal range querying.
Inf. Syst., 2013

DACs: Bringing direct access to variable-length codes.
Inf. Process. Manage., 2013

Compact binary relation representations with rich functionality.
Inf. Comput., 2013

Indexes and Computation over Compressed Structured Data (Dagstuhl Seminar 13232).
Dagstuhl Reports, 2013

Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences.
ACM Comput. Surv., 2013

Practical Compressed Suffix Trees.
Algorithms, 2013

Better Space Bounds for Parameterized Range Majority and Minority.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Faster Top-k Document Retrieval in Optimal Space.
Proceedings of the String Processing and Information Retrieval, 2013

A Lempel-Ziv Compressed Structure for Document Listing.
Proceedings of the String Processing and Information Retrieval, 2013

Compact Querieable Representations of Raster Data.
Proceedings of the String Processing and Information Retrieval, 2013

Optimal Dynamic Sequence Representations.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Faster and smaller inverted indices with treaps.
Proceedings of the 36th International ACM SIGIR conference on research and development in Information Retrieval, 2013

Top-k Document Retrieval in Compact Space and Near-Optimal Time.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Encodings for Range Selection and Top-k Queries.
Proceedings of the Algorithms - ESA 2013, 2013

Compressing Huffman Models on Large Alphabets.
Proceedings of the 2013 Data Compression Conference, 2013

Faster Compact Top-k Document Retrieval.
Proceedings of the 2013 Data Compression Conference, 2013

Document Listing on Repetitive Collections.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Maximum-Weight Planar Boxes in O(n2) Time (and Better).
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Word-based self-indexes for natural language text.
ACM Trans. Inf. Syst., 2012

New algorithms on wavelet trees and applications to information retrieval.
Theor. Comput. Sci., 2012

String matching with alphabet sampling.
J. Discrete Algorithms, 2012

Implicit indexing of natural language text by reorganizing bytecodes.
Inf. Retr., 2012

Boosting Text Compression with Word-Based Statistical Encoding.
Comput. J., 2012

Stronger Lempel-Ziv Based Compressed Text Indexing.
Algorithmica, 2012

Space-Efficient Top-k Document Retrieval.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Fast, Small, Simple Rank/Select on Bitmaps.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Sorted Range Reporting.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Dual-Sorted Inverted Lists in Practice.
Proceedings of the String Processing and Information Retrieval, 2012

Compressed Representation of Web and Social Networks via Dense Subgraphs.
Proceedings of the String Processing and Information Retrieval, 2012

Improved Grammar-Based Compressed Indexes.
Proceedings of the String Processing and Information Retrieval, 2012

The Wavelet Matrix.
Proceedings of the String Processing and Information Retrieval, 2012

Smaller Self-indexes for Natural Language.
Proceedings of the String Processing and Information Retrieval, 2012

Ranked Document Retrieval in (Almost) No Space.
Proceedings of the String Processing and Information Retrieval, 2012

Compressed Suffix Trees for Repetitive Texts.
Proceedings of the String Processing and Information Retrieval, 2012

Top-k document retrieval in optimal time and linear space.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Indexing Highly Repetitive Collections.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

New Lower and Upper Bounds for Representing Sequences.
Proceedings of the Algorithms - ESA 2012, 2012

Compressed Dynamic Binary Relations.
Proceedings of the 2012 Data Compression Conference, Snowbird, UT, USA, April 10-12, 2012, 2012

Wavelet Trees for All.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Adaptive Techniques to find Optimal Planar Boxes.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Fully dynamic metric access methods based on hyperplane partitioning.
Inf. Syst., 2011

Improving semistatic compression via phrase-based modeling.
Inf. Process. Manage., 2011

Stronger Quickheaps.
Int. J. Found. Comput. Sci., 2011

Space-efficient construction of Lempel-Ziv compressed text indexes.
Inf. Comput., 2011

Self-Indexed Grammar-Based Compression.
Fundam. Inform., 2011

Practical Compressed Document Retrieval.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Compressed String Dictionaries.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Improved Compressed Indexes for Full-Text Document Retrieval.
Proceedings of the String Processing and Information Retrieval, 2011

Succinct nearest neighbor search.
Proceedings of the Fourth International Conference on Similarity Search and Applications, 2011

Space-Efficient Data-Analysis Queries on Grids.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Alphabet-Independent Compressed Text Indexing.
Proceedings of the Algorithms - ESA 2011, 2011

Self-indexing Based on LZ77.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Indexes for highly repetitive document collections.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

Backwards Search in Context Bound Text Transformations.
Proceedings of the First International Conference on Data Compression, 2011

2010
Fast and Compact Web Graph Representations.
TWEB, 2010

Dynamic lightweight text compression.
ACM Trans. Inf. Syst., 2010

Fundamentals of the problem.
SIGSPATIAL Special, 2010

Practical approaches to reduce the space requirement of lempel-ziv-based compressed text indices.
ACM Journal of Experimental Algorithmics, 2010

The longest common extension problem revisited and applications to approximate string searching.
J. Discrete Algorithms, 2010

Storage and Retrieval of Highly Repetitive Sequence Collections.
Journal of Computational Biology, 2010

On Sorting, Heaps, and Minimum Spanning Trees.
Algorithmica, 2010

Practical Compressed Suffix Trees.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Dual-Sorted Inverted Lists.
Proceedings of the String Processing and Information Retrieval, 2010

Colored Range Queries and Document Retrieval.
Proceedings of the String Processing and Information Retrieval, 2010

Fast and Compact Prefix Codes.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Fully-Functional Succinct Trees.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

An efficient implementation of a flexible XPath extension.
Proceedings of the Recherche d'Information Assistée par Ordinateur, 2010

Compact Rich-Functional Binary Relation Representations.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

A compressed self-indexed representation of XML documents.
Proceedings of the XV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2010), 2010

Entropy-Bounded Representation of Point Grids.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Alphabet Partitioning for Compressed Rank/Select and Applications.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Fast in-memory XPath search using compressed indexes.
Proceedings of the 26th International Conference on Data Engineering, 2010

A Fun Application of Compact Data Structures to Indexing Geographic Data.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Top-k Ranked Document Search in General Text Databases.
Proceedings of the Algorithms, 2010

Range Queries over a Compact Representation of Minimum Bounding Rectangles.
Proceedings of the Advances in Conceptual Modeling - Applications and Challenges, 2010

LZ77-Like Compression with Fast Random Access.
Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

A New Searchable Variable-to-Variable Compressor.
Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

Parallel and Distributed Compressed Indexes.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Extended Compact Web Graph Representations.
Proceedings of the Algorithms and Applications, 2010

Compressed q-Gram Indexing for Highly Repetitive Biological Sequences.
Proceedings of the 10th IEEE International Conference on Bioinformatics and Bioengineering, 2010

Self-Indexing XML.
Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, 2010

Succinct Trees in Practice.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009
Text Index Compression.
Proceedings of the Encyclopedia of Database Systems, 2009

Managing Compressed Structured Text.
Proceedings of the Encyclopedia of Database Systems, 2009

Rank/select on dynamic compressed sequences and applications.
Theor. Comput. Sci., 2009

Faster entropy-bounded compressed suffix trees.
Theor. Comput. Sci., 2009

Improving the space cost of k -NN search in metric spaces by using distance estimators.
Multimedia Tools Appl., 2009

Speeding up spatial approximation search in metric spaces.
ACM Journal of Experimental Algorithmics, 2009

Editorial.
J. Discrete Algorithms, 2009

Parameterized matching on non-linear structures.
Inf. Process. Lett., 2009

Approximate String Matching with Compressed Indexes.
Algorithms, 2009

Implementation and Application of Automata in String Processing.
Proceedings of the Implementation and Application of Automata, 2009

Combining Text Compression and String Matching: The Miracle of Self-Indexing.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Compressed Representations of Permutations, and Applications.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Indexing Variable Length Substrings for Exact and Approximate Matching.
Proceedings of the String Processing and Information Retrieval, 2009

Directly Addressable Variable-Length Codes.
Proceedings of the String Processing and Information Retrieval, 2009

k2-Trees for Compact Web Graph Representation.
Proceedings of the String Processing and Information Retrieval, 2009

EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory.
Proceedings of the Second International Workshop on Similarity Search and Applications, 2009

Dynamic Spatial Approximation Trees for Massive Data.
Proceedings of the Second International Workshop on Similarity Search and Applications, 2009

Analyzing Metric Space Indexes: What For?
Proceedings of the Second International Workshop on Similarity Search and Applications, 2009

Storage and Retrieval of Individual Genomes.
Proceedings of the Research in Computational Molecular Biology, 2009

Self-indexed Text Compression Using Straight-Line Programs.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Indexación espacial de puntos empleando wavelet trees.
Proceedings of the XIV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2009), 2009

Reorganizing Compressed Text.
Proceedings of the XIV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2009), 2009

A Compressed Self-indexed Representation of XML Documents.
Proceedings of the Research and Advanced Technology for Digital Libraries, 2009

A New Point Access Method Based on Wavelet Trees.
Proceedings of the Advances in Conceptual Modeling - Challenging Perspectives, 2009

2008
Sequential Approximate String Matching.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximate Regular Expression Matching.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Compressed Text Indexing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

New adaptive compressors for natural language text.
Softw., Pract. Exper., 2008

Effective Proximity Retrieval by Ordering Permutations.
IEEE Trans. Pattern Anal. Mach. Intell., 2008

Implementing the LZ-index: Theory versus practice.
ACM Journal of Experimental Algorithmics, 2008

Compressed text indexes: From theory to practice.
ACM Journal of Experimental Algorithmics, 2008

Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections.
Proceedings of the String Processing and Information Retrieval, 2008

Indexed Hierarchical Approximate String Matching.
Proceedings of the String Processing and Information Retrieval, 2008

Speeding Up Pattern Matching by Text Sampling.
Proceedings of the String Processing and Information Retrieval, 2008

Practical Rank/Select Queries over Arbitrary Sequences.
Proceedings of the String Processing and Information Retrieval, 2008

Self-indexing Natural Language.
Proceedings of the String Processing and Information Retrieval, 2008

Reorganizing compressed text.
Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2008

Fully-Compressed Suffix Trees.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Improved Dynamic Rank-Select Entropy-Bound Structures.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Un Sistema de Consulta sobre Documentos Transformados con LZCS.
Proceedings of the XIII Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2008), 2008

Message from the SISAP'08 program committee co-chairs.
Proceedings of the 24th International Conference on Data Engineering Workshops, 2008

Re-pair Achieves High-Order Entropy.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

On Self-Indexing Images - Image Compression with Added Value.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Word-Based Statistical Compressors as Natural Language Compression Boosters.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Storage and Retrieval of Individual Genomes.
Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

An In-Memory XQuery/XPath Engine over a Compressed Structured Text Representation.
Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

Dynamic Fully-Compressed Suffix Trees.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

On-Line Approximate String Matching with Bounded Errors.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

An(other) Entropy-Bounded Compressed Suffix Tree.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
Rank and select revisited and extended.
Theor. Comput. Sci., 2007

Compressed representations of sequences and full-text indexes.
ACM Trans. Algorithms, 2007

Lempel-Ziv compression of highly structured documents.
JASIST, 2007

Lightweight natural language text compression.
Inf. Retr., 2007

Using structural contexts to compress semistructured text collections.
Inf. Process. Manage., 2007

t-Spanners for metric space searching.
Data Knowl. Eng., 2007

Compressed full-text indexes.
ACM Comput. Surv., 2007

Approximate String Matching with Lempel-Ziv Compressed Indexes.
Proceedings of the String Processing and Information Retrieval, 2007

Implicit Compression Boosting with Applications to Self-indexing.
Proceedings of the String Processing and Information Retrieval, 2007

A Fast and Compact Web Graph Representation.
Proceedings of the String Processing and Information Retrieval, 2007

Compressed Text Indexes with Fast Locate.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

A Lempel-Ziv Text Index on Secondary Storage.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
A metric index for approximate string matching.
Theor. Comput. Sci., 2006

A Simple Alphabet-independent Fm-index.
Int. J. Found. Comput. Sci., 2006

Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

On the Least Cost for Proximity Searching in Metric Spaces.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

FM-KZ: An even simpler alphabet-independent FM-index.
Proceedings of the Prague Stringology Conference, 2006

Position-Restricted Substring Searching.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

An Index Data Structure for Searching in Metric Space Databases.
Proceedings of the Computational Science, 2006

Improving Semistatic Compression Via Pair-Based Coding.
Proceedings of the Perspectives of Systems Informatics, 2006

Dynamic Entropy-Compressed Sequences and Full-Text Indexes.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

Statistical Encoding of Succinct Data Structures.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

Reducing the Space Requirement of LZ-Index.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

Optimal Incremental Sorting.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005
Sequential and indexed two-dimensional combinatorial template matching allowing rotations.
Theor. Comput. Sci., 2005

LZgrep: a Boyer-Moore string matching tool for Ziv-Lempel compressed text.
Softw., Pract. Exper., 2005

A compact space decomposition for effective metric indexing.
Pattern Recognition Letters, 2005

Increased bit-parallelism for approximate and multiple string matching.
ACM Journal of Experimental Algorithmics, 2005

Indexing text with approximate q-grams.
J. Discrete Algorithms, 2005

Practical algorithms for transposition-invariant string-matching.
J. Discrete Algorithms, 2005

Bit-parallel (delta, gamma)-matching and suffix automata.
J. Discrete Algorithms, 2005

Transposition invariant string matching.
J. Algorithms, 2005

New bounds on D-ary optimal codes.
Inf. Process. Lett., 2005

New Techniques for Regular Expression Searching.
Algorithmica, 2005

Bit-Parallel Witnesses and Their Applications to Approximate String Matching.
Algorithmica, 2005

Bit-parallel computation of local similarity score matrices with unitary weights.
Proceedings of the Prague Stringology Conference, 2005

A simple alphabet-independent FM-index.
Proceedings of the Prague Stringology Conference, 2005

Flexible music retrieval in sublinear time.
Proceedings of the Prague Stringology Conference, 2005

Efficiently decodable and searchable natural language adaptive compression.
Proceedings of the SIGIR 2005: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2005

Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order.
Proceedings of the MICAI 2005: Advances in Artificial Intelligence, 2005

Space-Efficient Construction of LZ-Index.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

A spatio-temporal access method based on snapshots and events.
Proceedings of the 13th ACM International Workshop on Geographic Information Systems, 2005

Compressing Dynamic Text Collections via Phrase-Based Coding.
Proceedings of the Research and Advanced Technology for Digital Libraries, 2005

Combining Structural and Textual Contexts for Compressing Semistructured Databases.
Proceedings of the Sixth Mexican International Conference on Computer Science (ENC 2005), 2005

Succinct Suffix Arrays Based on Run-Length Encoding.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

Approximate Searching on Compressed Text.
Proceedings of the 15th International Conference on Electronics, Communications, and Computers (CONIELECOMP 2005), 28 February 2005, 2005

Text Databases.
Proceedings of the Encyclopedia of Database Technologies and Applications, 2005

Metric Databases.
Proceedings of the Encyclopedia of Database Technologies and Applications, 2005

2004
Average complexity of exact and approximate multiple string matching.
Theor. Comput. Sci., 2004

Average-optimal single and multiple approximate string matching.
ACM Journal of Experimental Algorithmics, 2004

Practical and flexible pattern matching over Ziv-Lempel compressed text.
J. Discrete Algorithms, 2004

Increased Bit-Parallelism for Approximate String Matching.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS.
Proceedings of the String Processing and Information Retrieval, 2004

First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index.
Proceedings of the String Processing and Information Retrieval, 2004

An Alphabet-Friendly FM-Index.
Proceedings of the String Processing and Information Retrieval, 2004

Simple, Fast, and Efficient Natural Language Adaptive Compression..
Proceedings of the String Processing and Information Retrieval, 2004

Rotation and Lighting Invariant Template Matching.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Lempel-Ziv Compression of Structured Text.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

Merging Prediction by Partial Matching with Structural Contexts Model.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

Compressed Compact Suffix Arrays.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

Improved Single and Multiple Approximate String Matching.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

On NFA Reductions.
Proceedings of the Theory Is Forever, 2004

2003
Optimal binary search trees with costs depending on the access paths.
Theor. Comput. Sci., 2003

Regular expression searching on compressed text.
J. Discrete Algorithms, 2003

Approximate string matching on Ziv-Lempel compressed text.
J. Discrete Algorithms, 2003

Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching.
Journal of Computational Biology, 2003

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

Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
Inf. Process. Lett., 2003

Fast Multipattern Search Algorithms for Intrusion Detection.
Fundam. Inform., 2003

Approximate Matching of Run-Length Compressed Strings.
Algorithmica, 2003

Matching Numeric Strings under Noise.
Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003

Algorithms for Transposition Invariant String Matching.
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.
Proceedings of the String Processing and Information Retrieval, 2003

Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval.
Proceedings of the String Processing and Information Retrieval, 2003

A Practical Index for Genome Searching.
Proceedings of the String Processing and Information Retrieval, 2003

A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval.
Proceedings of the String Processing and Information Retrieval, 2003

(S, C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases.
Proceedings of the String Processing and Information Retrieval, 2003

Memory-Adaptive Dynamic Spatial Approximation Trees.
Proceedings of the String Processing and Information Retrieval, 2003

SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases.
Proceedings of the String Processing and Information Retrieval, 2003

Improved Deletions in Dynamic Spatial Approximation Trees.
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.
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.
Proceedings of the IV Jornadas de Bibliotecas Digitales, 2003

Approximate Regular Expression Searching with Arbitrary Integer Weights.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Suffix Arrays in Parallel.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Current Challenges in Textual Databases.
Proceedings of the 4th Mexican International Conference on Computer Science (ENC 2003), 2003

An Efficient Compression Code for Text Databases.
Proceedings of the Advances in Information Retrieval, 2003

Compressing Semistructured Text Databases.
Proceedings of the Advances in Information Retrieval, 2003

Average-Optimal Multiple Approximate String Matching.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

Practical Constraction of Metric t-Spanners.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

Clustering in Metric Spaces with Applications to Information Retrieval.
Proceedings of the Clustering and Information Retrieval, 2003

2002
New and faster filters for multiple approximate string matching.
Random Struct. Algorithms, 2002

XQL and proximal nodes.
JASIST, 2002

Fully Dynamic Spatial Approximation Trees.
Proceedings of the String Processing and Information Retrieval, 2002

t-Spanners as a Data Structure for Metric Space Searching.
Proceedings of the String Processing and Information Retrieval, 2002

Indexing Text Using the Ziv-Lempel Trie.
Proceedings of the String Processing and Information Retrieval, 2002

Probabilistic Proximity Searching Algorithms Based on Compact Partitions.
Proceedings of the String Processing and Information Retrieval, 2002

Improved Antidictionary Based Compression.
Proceedings of the 22nd International Conference of the Chilean Computer Science Society (SCCC 2002), 2002

A Metric Index for Approximate String Matching.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Faster Bit-Parallel Approximate String Matching.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations.
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.
Cambridge University Press, ISBN: 978-0-521-81307-5, 2002

2001
NR-grep: a fast and flexible pattern-matching tool.
Softw., Pract. Exper., 2001

Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching.
Multimedia Tools Appl., 2001

Indexing Methods for Approximate String Matching.
IEEE Data Eng. Bull., 2001

A guided tour to approximate string matching.
ACM Comput. Surv., 2001

Searching in metric spaces.
ACM Comput. Surv., 2001

Improving an Algorithm for Approximate Pattern Matching.
Algorithmica, 2001

Compact DFA Representation for Fast Regular Expression Search.
Proceedings of the Algorithm Engineering, 2001

Dynamic Spatial Approximation Trees.
Proceedings of the 21st International Conference of the Chilean Computer Science Society (SCCC 2001), 2001

Pivot Selection Techniques for Proximity Searching in Metric Spaces.
Proceedings of the 21st International Conference of the Chilean Computer Science Society (SCCC 2001), 2001

Matchsimile: A Flexible Approximate Matching Tool for Personal Names Searching.
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.
Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

Faster Approximate String Matching over Compressed Text.
Proceedings of the Data Compression Conference, 2001

Regular Expression Searching over Ziv-Lempel Compressed Text.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

Approximate Matching of Run-Length Compressed Strings.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

A Probabilistic Spell for the Curse of Dimensionality.
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000
Fast and flexible word searching on compressed text.
ACM Trans. Inf. Syst., 2000

Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata.
ACM Journal of Experimental Algorithmics, 2000

Adding Compression to Block Addressing Inverted Indexes.
Inf. Retr., 2000

Compression: A Key for Next-Generation Text Retrieval Systems.
IEEE Computer, 2000

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

Fast Multipattern Search Algorithms for Intrusion Detection.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

An Effective Clustering Algorithm to Index High Dimensional Metric Spaces.
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.
Proceedings of the Recent Advances in Intrusion Detection, Third International Workshop, 2000

Tessellations of Cuboids with Steiner Points.
Proceedings of the 9th International Meshing Roundtable, 2000

An Index for Two Dimensional String Matching Allowing Rotations.
Proceedings of the Theoretical Computer Science, 2000

Boyer-Moore String Matching over Ziv-Lempel Compressed Text.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Indexing Text with Approximate q-Grams.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Approximate String Matching over Ziv-Lempel Compressed Text.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999
Bounding the Expected Length of Longest Common Subsequences and Forests.
Theory Comput. Syst., 1999

Very Fast and Simple Approximate String Matching.
Inf. Process. Lett., 1999

Faster Approximate String Matching.
Algorithmica, 1999

Fast Regular Expression Search.
Proceedings of the Algorithm Engineering, 1999

Searching in Metric Spaces by Spatial Approximation.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Linear Time Sorting of Skewed Distributions.
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.
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.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

Fast Multi-dimensional Approximate Pattern Matching.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

A New Indexing Method for Approximate String Matching.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998
A Practical q -Gram Index for Text Retrieval Allowing Errors.
CLEI Electron. J., 1998

Direct Pattern Matching on Compressed Text.
Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998

A Model and a Visual Query Language for Structured Text.
Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998

Fast Approximate String Matching in a Dictionary.
Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998

Fast Searching on Compressed Text Allowing Errors.
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.
Proceedings of 18th International Conference of the Chilean Computer Science Society (SCCC '98), 1998

Improved Approximate Pattern Matching on Hypertext.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

Fast Two-Dimensional Approximate Pattern Matching
Proceedings of the LATIN '98: Theoretical Informatics, 1998

A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching.
Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998

1997
Proximal Nodes: A Model to Query Document Databases by Content and Structure.
ACM Trans. Inf. Syst., 1997

Multiple Approximate String Matching.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Distributed Generation of Suffix Arrays.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

Block Addressing Indices for Approximate Text Retrieval.
Proceedings of the Sixth International Conference on Information and Knowledge Management (CIKM'97), 1997

1996
Integrating Contents and Structure in Text Retrieval.
SIGMOD Record, 1996

A Faster Algorithm for Approximate String Matching.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
A Language for Queries on Structure and Contents of Textual.
Proceedings of the SIGIR'95, 1995

Optimized Binary Search and Text Retrieval.
Proceedings of the Algorithms, 1995


  Loading...