Gonzalo Navarro | Academic Influence

Gonzalo Navarro's AcademicInfluence.com Rankings

Gonzalo Navarro

Computer Science

#2429

World Rank

#2536

Historical Rank

Database

#911

World Rank

#958

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Gonzalo Navarro's Degrees

Masters Computer Science University of Chile
Bachelors Computer Science University of Chile

Similar Degrees You Can Earn

Why Is Gonzalo Navarro Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Gonzalo Navarro Badino is a full professor of computer science at the University of Chile and ACM Distinguished Member, whose interests include algorithms and data structures, data compression and text searching. He also participates in the Center for Biotechnology and Bioengineering and the Millennium Institute for Foundational Research on Data .. He obtained his PhD at the University of Chile in 1998 under the supervision of Ricardo Baeza-Yates with the thesis Approximate Text Searching, then worked as a post-doctoral researcher with Esko Ukkonen and Maxime Crochemore.

(See a Problem?)

Gonzalo Navarro's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A guided tour to approximate string matching (2001) (2647)
Searching in metric spaces (2001) (1331)
Compressed full-text indexes (2007) (744)
Flexible pattern matching in strings - practical on-line search algorithms for texts and biological sequences (2002) (446)
Compressed representations of sequences and full-text indexes (2007) (352)
Searching in metric spaces by spatial approximation (1999) (321)
Compact Data Structures - A Practical Approach (2016) (271)
Fast and flexible word searching on compressed text (2000) (271)
Pivot selection techniques for proximity searching in metric spaces (2001) (237)
Indexing Methods for Approximate String Matching (2001) (225)
Storage and Retrieval of Highly Repetitive Sequence Collections (2010) (212)
Effective Proximity Retrieval by Ordering Permutations (2008) (197)
Succinct Suffix Arrays based on Run-Length Encoding (2005) (197)
Fast and flexible string matching by combining bit-parallelism and suffix automata (2000) (197)
Wavelet trees for all (2012) (188)
Fully Functional Static and Dynamic Succinct Trees (2009) (185)
A compact space decomposition for effective metric indexing (2005) (185)
Proximal nodes: a model to query document databases by content and structure (1997) (178)
Dynamic entropy-compressed sequences and full-text indexes (2006) (159)
Faster Approximate String Matching (1999) (156)
Compressed text indexes: From theory to practice (2007) (155)
Compression: A Key for Next-Generation Text Retrieval Systems (2000) (149)
On compressing and indexing repetitive sequences (2013) (149)
Indexing text using the Ziv-Lempel trie (2002) (148)
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching (1998) (139)
Rank and select revisited and extended (2007) (138)
Fully-functional succinct trees (2010) (137)
Integrating contents and structure in text retrieval (1996) (136)
Practical Rank/Select Queries over Arbitrary Sequences (2008) (133)
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text (1999) (123)
NR‐grep: a fast and flexible pattern‐matching tool (2001) (122)
Compact representation of Web graphs with extended functionality (2014) (117)
k2-Trees for Compact Web Graph Representation (2009) (114)
Adding Compression to Block Addressing Inverted Indexes (2000) (113)
An Alphabet-Friendly FM-Index (2004) (109)
A Hybrid Indexing Method for Approximate String Matching (2007) (105)
New algorithms on wavelet trees and applications to information retrieval (2010) (105)
Succinct Trees in Practice (2010) (104)
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space (2018) (102)
DACs: Bringing direct access to variable-length codes (2013) (102)
Block addressing indices for approximate text retrieval (1997) (101)
A Faster Algorithm for Approximate String Matching (1996) (98)
(S, C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases (2003) (97)
Fully compressed suffix trees (2008) (95)
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching (2001) (94)
Self-Indexed Grammar-Based Compression (2011) (93)
Compressed Text Indexes with Fast Locate (2007) (93)
Top-k document retrieval in optimal time and linear space (2012) (93)
A language for queries on structure and contents of textual databases (1995) (93)
Alphabet-Independent Compressed Text Indexing (2011) (92)
Indexing text with approximate q-grams (2000) (92)
Optimal-Time Text Indexing in BWT-runs Bounded Space (2017) (92)
Fast, Small, Simple Rank/Select on Bitmaps (2012) (90)
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections (2008) (90)
Faster entropy-bounded compressed suffix trees (2009) (89)
Word-based self-indexes for natural language text (2012) (89)
Fast and Compact Web Graph Representations (2010) (88)
A Practical q -Gram Index for Text Retrieval Allowing Errors (2018) (87)
An Efficient Compression Code for Text Databases (2003) (87)
Fast approximate string matching in a dictionary (1998) (86)
Lightweight natural language text compression (2006) (85)
Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching (2003) (85)
Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces (2006) (83)
Improved Grammar-Based Compressed Indexes (2011) (81)
LZ77-Like Compression with Fast Random Access (2010) (81)
Top-k Ranked Document Search in General Text Databases (2010) (76)
Optimal Dynamic Sequence Representations (2012) (75)
Implicit Compression Boosting with Applications to Self-indexing (2007) (74)
Self-indexing Based on LZ77 (2011) (74)
Boyer-Moore String Matching over Ziv-Lempel Compressed Text (2000) (72)
Fast searching on compressed text allowing errors (1998) (71)
Alphabet Partitioning for Compressed Rank/Select and Applications (2010) (71)
Colored range queries and document retrieval (2010) (69)
Practical Compressed Suffix Trees (2010) (67)
Position-Restricted Substring Searching (2006) (66)
Dynamic spatial approximation trees (2001) (65)
Spaces, Trees, and Colors (2013) (63)
A Probabilistic Spell for the Curse of Dimensionality (2001) (63)
Average-optimal single and multiple approximate string matching (2004) (60)
On NFA Reductions (2004) (60)
Approximate Matching of Run-Length Compressed Strings (2001) (60)
Compressed Representations of Permutations, and Applications (2009) (59)
Large text searching allowing errors (1997) (59)
Optimal Lower and Upper Bounds for Representing Sequences (2011) (59)
Statistical Encoding of Succinct Data Structures (2006) (59)
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time (2016) (57)
Very Fast and Simple Approximate String Matching (1999) (56)
Storage and Retrieval of Individual Genomes (2009) (56)
The wavelet matrix: An efficient wavelet tree for large alphabets (2015) (55)
Compressed q-Gram Indexing for Highly Repetitive Biological Sequences (2010) (55)
A metric index for approximate string matching (2002) (55)
Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces (2003) (55)
Compressed representations for web and social graphs (2014) (53)
Improved compressed indexes for full-text document retrieval (2011) (52)
Improved approximate pattern matching on hypertext (1998) (52)
A Fast and Compact Web Graph Representation (2007) (52)
Transposition invariant string matching (2005) (52)
Stronger Lempel-Ziv Based Compressed Text Indexing (2012) (51)
An effective clustering algorithm to index high dimensional metric spaces (2000) (51)
Pattern Matching (2008) (50)
Sorted Range Reporting (2012) (50)
Compressed Compact Suffix Arrays (2004) (49)
Reorganizing compressed text (2008) (49)
Probabilistic proximity searching algorithms based on compact partitions (2002) (48)
Flexible Pattern Matching in Strings: Approximate matching (2002) (48)
Approximate String Matching with Compressed Indexes (2009) (48)
Compressed vertical partitioning for efficient RDF management (2015) (47)
Directly Addressable Variable-Length Codes (2009) (47)
Reducing the Space Requirement of LZ-Index (2006) (47)
Compressed String Dictionaries (2011) (47)
Towards a Definitive Measure of Repetitiveness (2019) (46)
Metric Spaces Library (2008) (46)
Efficient Fully-Compressed Sequence Representations (2009) (46)
Optimal-Time Dictionary-Compressed Indexes (2018) (45)
Extended Compact Web Graph Representations (2010) (45)
Bounding the Expected Length of Longest Common Subsequences and Forests (1999) (44)
Faster Bit-Parallel Approximate String Matching (2002) (44)
Practical compressed string dictionaries (2016) (44)
On compressing permutations and adaptive sorting (2011) (44)
Indexing Highly Repetitive Collections (2012) (43)
Fully Dynamic Spatial Approximation Trees (2002) (43)
Faster approximate string matching over compressed text (2001) (43)
Self-indexed Text Compression Using Straight-Line Programs (2009) (43)
The longest common extension problem revisited and applications to approximate string searching (2010) (43)
Compact Querieable Representations of Raster Data (2013) (43)
Direct pattern matching on compressed text (1998) (43)
New Lower and Upper Bounds for Representing Sequences (2011) (42)
Practical Compressed Document Retrieval (2011) (42)
A New Indexing Method for Approximate String Matching (1999) (42)
New and faster filters for multiple approximate string matching (2002) (42)
Universal Compressed Text Indexing (2018) (41)
Multiple Approximate String Matching (1997) (41)
New Techniques for Regular Expression Searching (2005) (41)
XQL and proximal nodes (2002) (41)
Average complexity of exact and approximate multiple string matching (2004) (41)
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations (2002) (40)
Space-Efficient Data-Analysis Queries on Grids (2011) (40)
Compact DFA Representation for Fast Regular Expression Search (2001) (40)
Fast in-memory XPath search using compressed indexes (2010) (40)
Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays (2004) (40)
Improving an Algorithm for Approximate Pattern Matching (2001) (39)
Dynamic Spatial Approximation Trees for Massive Data (2009) (39)
Approximate String Matching over Ziv-Lempel Compressed Text (2000) (39)
On the Least Cost for Proximity Searching in Metric Spaces (2006) (39)
Succinct nearest neighbor search (2011) (38)
Indexing Highly Repetitive String Collections, Part I: Repetitiveness Measures (2020) (37)
Overcoming the Curse of Dimensionality (1999) (37)
Bit-Parallel Witnesses and Their Applications to Approximate String Matching (2004) (36)
Fully dynamic metric access methods based on hyperplane partitioning (2011) (36)
LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text (2005) (35)
The Wavelet Matrix (2012) (35)
Approximate string matching on Ziv-Lempel compressed text (2003) (34)
Rank/select on dynamic compressed sequences and applications (2009) (34)
Dual-Sorted Inverted Lists (2010) (34)
Universal indexes for highly repetitive document collections (2016) (33)
Compact Rich-Functional Binary Relation Representations (2010) (33)
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order (2005) (33)
Lempel-Ziv compression of structured text (2004) (33)
Faster and smaller inverted indices with treaps (2013) (32)
Fast and simple character classes and bounded gaps pattern matching, with application to protein searching (2001) (32)
Rotation and lighting invariant template matching (2004) (31)
Increased bit-parallelism for approximate and multiple string matching (2005) (31)
Dynamic lightweight text compression (2010) (30)
Improved Dynamic Rank-Select Entropy-Bound Structures (2008) (30)
An(other) Entropy-Bounded Compressed Suffix Tree (2008) (30)
Implicit indexing of natural language text by reorganizing bytecodes (2012) (30)
An empirical evaluation of intrinsic dimension estimators (2015) (29)
Optimal Incremental Sorting (2006) (29)
Near neighbor searching with K nearest references (2015) (29)
Measuring the Dimensionality of General Metric Spaces (2000) (29)
Fast Regular Expression Search (1999) (29)
Matchsimile: a Flexible Approximate Matching Tool for Searching Proper Name (2003) (29)
Faster Compact Top-k Document Retrieval (2012) (28)
Analyzing Metric Space Indexes: What For? (2009) (28)
t-Spanners as a Data Structure for Metric Space Searching (2002) (28)
A Simple Alphabet-independent Fm-index (2006) (27)
New approaches for predicting protein retention time in hydrophobic interaction chromatography (2006) (27)
Speeding up spatial approximation search in metric spaces (2009) (27)
Faster Compressed Suffix Trees for Repetitive Text Collections (2014) (26)
A Compact RDF Store Using Suffix Arrays (2015) (26)
A spatio-temporal access method based on snapshots and events (2005) (26)
Space-Efficient Top-k Document Retrieval (2012) (26)
A Compressed Text Index on Secondary Memory ∗ (2007) (26)
Re-pair Achieves High-Order Entropy (2008) (25)
Implementing the LZ-index: Theory versus practice (2009) (25)
Regular expression searching on compressed text (2003) (25)
Faster Compressed Suffix Trees for Repetitive Collections (2016) (25)
Dynamic Fully-Compressed Suffix Trees (2008) (25)
Compact binary relation representations with rich functionality (2012) (25)
Space-efficient construction of Lempel-Ziv compressed text indexes (2011) (24)
Indexing Highly Repetitive String Collections, Part II: Compressed Indexes (2020) (24)
A Pattern Matching Based Filter for Audit Reduction and Fast Detection of Potential Intrusions (2000) (24)
On the Approximation Ratio of Lempel-Ziv Parsing (2018) (24)
Locally Compressed Suffix Arrays (2015) (24)
Algorithms for Transposition Invariant String Matching (2003) (24)
Merging prediction by partial matching with structural contexts model (2004) (23)
Compressed Representation of Web and Social Networks via Dense Subgraphs (2012) (23)
Parallel generation of inverted files for distributed text collections (1998) (23)
Improved antidictionary based compression (2002) (23)
Practical algorithms for transposition-invariant string-matching (2005) (23)
Searching large text collections (2002) (23)
New adaptive compressors for natural language text (2008) (22)
Indexes for highly repetitive document collections (2011) (22)
Word-Based Statistical Compressors as Natural Language Compression Boosters (2008) (22)
A model and a visual query language for structured text (1998) (21)
Improved Range Minimum Queries (2016) (21)
Space-efficient representations of rectangle datasets supporting orthogonal range querying (2013) (21)
RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy (2019) (21)
Practical Constraction of Metric t-Spanners (2003) (20)
A Lempel-Ziv Text Index on Secondary Storage (2007) (20)
Compressed Dynamic Binary Relations (2012) (20)
Fast multipattern search algorithms for intrusion detection (2000) (20)
Document Listing on Repetitive Collections (2013) (20)
Document Listing on Repetitive Collections with Guaranteed Performance (2017) (20)
An Index Data Structure for Searching in Metric Space Databases (2006) (20)
Maximum-Weight Planar Boxes in O(n2) Time (and Better) (2014) (20)
Using structural contexts to compress semistructured text collections (2007) (20)
Time-Optimal Top-k Document Retrieval (2017) (20)
String matching with alphabet sampling (2012) (20)
Rpair: Rescaling RePair with Rsync (2019) (20)
New dynamic metric indices for secondary memory (2016) (20)
Space-Efficient Construction of LZ-Index (2005) (20)
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval (2000) (20)
Approximate Regular Expression Searching with Arbitrary Integer Weights (2004) (19)
Increased Bit-Parallelism for Approximate String Matching (2004) (19)
GraCT: A Grammar-based Compressed Index for Trajectory Data (2019) (19)
Bit-parallel (delta, gamma)-matching and suffix automata (2005) (19)
Compressed representation of dynamic binary relations with applications (2017) (19)
A Fun Application of Compact Data Structures to Indexing Geographic Data (2010) (18)
A Self-index on Block Trees (2016) (18)
Memory-Adaptive Dynamic Spatial Approximation Trees (2003) (18)
Distributed Generation of Suffix Arrays (1997) (18)
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations (2010) (17)
Encoding range minima and range top-2 queries (2014) (17)
Grammar compressed sequences with rank/select support (2014) (17)
Fast and Compact Planar Embeddings (2016) (17)
Practical and flexible pattern matching over Ziv-Lempel compressed text (2004) (16)
New space/time tradeoffs for top-k document retrieval on sequences (2014) (16)
General Document Retrieval in Compact Space (2015) (16)
Entropy-bounded representation of point grids (2010) (16)
Flexible Music Retrieval in Sublinear Time (2006) (16)
Efficiently decodable and searchable natural language adaptive compression (2005) (16)
A Grammar Compression Algorithm Based on Induced Suffix Sorting (2017) (16)
A Partial Deterministic Automaton for Approximate String Matching (1997) (16)
Succinct Representation of Sequences (2008) (16)
Relative Suffix Trees (2015) (15)
An Index for Two Dimensional String Matching Allowing Rotations (2000) (15)
Compression of Web and Social Graphs supporting Neighbor and Community Queries (2011) (15)
A New Point Access Method Based on Wavelet Trees (2009) (15)
Average-Optimal Multiple Approximate String Matching (2003) (15)
A bit-parallel suffix automaton approach for (δ, γ)-matching in music retrieval (2003) (15)
Faster Top-k Document Retrieval in Optimal Space (2013) (15)
Worst-Case Optimal Graph Joins in Almost No Space (2021) (15)
Simple, Fast, and Efficient Natural Language Adaptive Compression (2004) (15)
Encodings for Range Selection and Top-k Queries (2013) (15)
Document retrieval on repetitive string collections (2016) (15)
Self-indexing Natural Language (2008) (15)
Distributed Query Processing Using Suffix Arrays (2003) (14)
Document Retrieval on Repetitive Collections (2014) (14)
Indexing Variable Length Substrings for Exact and Approximate Matching (2009) (14)
Indexing Highly Repetitive String Collections (2020) (14)
Boosting Text Compression with Word-Based Statistical Encoding (2012) (14)
A New Searchable Variable-to-Variable Compressor (2010) (14)
Fast Fully-Compressed Suffix Trees (2014) (14)
First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index (2004) (14)
Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices (2010) (14)
On Sorting, Heaps, and Minimum Spanning Trees (2010) (14)
Better Space Bounds for Parameterized Range Majority and Minority (2012) (14)
Grammar-Compressed Indexes with Logarithmic Search Time (2020) (14)
On the Approximation Ratio of Ordered Parsings (2018) (14)
A Practical Index for Genome Searching (2003) (13)
Optimal Joins using Compact Data Structures (2019) (13)
Indexing Compressed Text (1997) (13)
Fast Two-Dimensional Approximate Pattern Matching (1999) (13)
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory (2009) (13)
Lempel-Ziv compression of highly structured documents (2007) (13)
Faster Repetition-Aware Compressed Suffix Trees based on Block Trees (2019) (13)
Metric Databases (2005) (12)
Faster Compressed Quadtrees (2014) (12)
Aggregated 2D range queries on clustered points (2016) (12)
Dual-Sorted Inverted Lists in Practice (2012) (12)
LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text: Research Articles (2005) (12)
On Self-Indexing Images - Image Compression with Added Value (2008) (12)
PFP Compressed Suffix Trees (2021) (12)
A fast distributed suffix array generation algorithm (1999) (12)
A succinct data structure for self-indexing ternary relations (2017) (12)
K 2-Treaps: Range Top-k Queries in Compact Space (2014) (12)
Lempel–Ziv-Like Parsing in Small Space (2019) (12)
Sequential and indexed two-dimensional combinatorial template matching allowing rotations (2005) (11)
Parallel and Distributed Compressed Indexes (2010) (11)
Tunneling on Wheeler Graphs (2018) (11)
Protein complex prediction via dense subgraphs and false positive analysis (2017) (11)
Asymptotically Optimal Encodings for Range Selection (2014) (11)
Optimized Binary Search and Text Retrieval (1995) (11)
A compressed self-indexed representation of XML documents (2009) (11)
Improved Single-Term Top-k Document Retrieval (2015) (11)
Approximate String Matching with Lempel-Ziv Compressed Indexes (2007) (11)
Optimal binary search trees with costs depending on the access paths (2003) (11)
Improved deletions in dynamic spatial approximation trees (2003) (11)
Text Searching: Theory and Practice (2004) (10)
Interleaved K2-Tree: Indexing and Navigating Ternary Relations (2014) (10)
Dynamic List of Clusters in Secondary Memory (2014) (10)
Parameterized matching on non-linear structures (2009) (10)
Practical Random Access to SLP-Compressed Texts (2020) (10)
Self-Index Based on LZ77 (2011) (10)
PHONI: Streamed Matching Statistics with Multi-Genome References (2020) (10)
PcapWT: An efficient packet extraction tool for large volume network traces (2015) (10)
Improving the space cost of k-NN search in metric spaces by using distance estimators (2009) (10)
Compact structure for sparse undirected graphs based on a clique graph partition (2021) (10)
Modeling Text Databases (2005) (9)
Compressing Huffman Models on Large Alphabets (2013) (9)
Fast In-Memory XPath Search over Compressed Text and Tree Indexes (2009) (9)
A grammar compressor for collections of reads with applications to the construction of the BWT (2020) (9)
t-Spanners for metric space searching (2007) (9)
Regular Expression Searching over Ziv-Lempel Compressed Text (2001) (9)
Distributed text search using suffix arrays (2014) (9)
Efficient Representation of Multidimensional Data over Hierarchical Domains (2016) (9)
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries (2017) (9)
Extending general compact querieable representations to GIS applications (2019) (9)
SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases (2003) (9)
Fast and Compact Prefix Codes (2009) (8)
New Models and Algorithms for Multidimensional Approximate Pattern Matching (2000) (8)
Block trees (2021) (8)
Compressed Suffix Trees for Repetitive Texts (2012) (8)
A Lempel-Ziv Compressed Structure for Document Listing (2013) (8)
Top-k Term-Proximity in Succinct Space (2017) (8)
GraCT: A Grammar Based Compressed Representation of Trajectories (2016) (8)
Fast Multi-dimensional Approximate Pattern Matching (1999) (8)
LZ78 Compression in Low Main Memory Space (2017) (8)
Run-Length FM-index (2004) (8)
Improved Time and Space Complexities for Transposition Invariant String Matching (2004) (8)
Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval (2003) (8)
Fast, Small, and Simple Document Listing on Repetitive Text Collections (2019) (8)
Text Indexing and Searching in Sublinear Time (2017) (8)
Matchsimile: A Flexible Approximate Matching Tool for Personal Names Searching (2001) (7)
Encodings for Range Majority Queries (2014) (7)
MillenniumDB: A Persistent, Open-Source, Graph Database (2021) (7)
Suffix Arrays in Parallel (2003) (7)
Toward a Definitive Compressibility Measure for Repetitive Sequences (2023) (7)
Simple and efficient fully-functional succinct trees (2016) (7)
Improving Semistatic Compression Via Pair-Based Coding (2006) (7)
Re-Pair Compression of Inverted Lists (2009) (7)
Ranked Document Selection (2014) (7)
Compressing Web Graphs like Texts ∗ (2007) (7)
New bounds on D-ary optimal codes (2005) (7)
FM-KZ: An even simpler alphabet-independent FM-index (2006) (7)
Practical Dynamic Entropy-Compressed Bitvectors with Applications (2016) (7)
Document Counting in Compressed Space (2015) (7)
Tessellations of Cuboids with Steiner Points (2000) (7)
Practical Indexing of Repetitive Collections Using Relative Lempel-Ziv (2019) (6)
Improved Single and Multiple Approximate String Matching (2004) (6)
Efficient and Compact Representations of Prefix Codes (2014) (6)
Top-k Document Retrieval in Compact Space and Near-Optimal Time (2013) (6)
Optimal Encodings for Range Majority Queries (2014) (6)
Approximating Optimal Bidirectional Macro Schemes (2020) (6)
Lempel-Ziv compression of highly structured documents: Research Articles (2007) (6)
On Stricter Reachable Repetitiveness Measures (2021) (6)
Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication (2018) (6)
Space-Efficient Computation of the Burrows-Wheeler Transform (2019) (6)
Improved and extended locating functionality on compressed suffix arrays (2014) (6)
Approximate Regular Expression Matching (2008) (5)
Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights (2006) (5)
Run-Length Compressed Indexes for Repetitive Sequence Collections (2008) (5)
A Fast and Small Subsampled R-index (2021) (5)
A Practical Index for Text Retrieval Allowing Errors (2008) (5)
Fast Compressed Self-indexes with Deterministic Linear-Time Construction (2017) (5)
Implementing the Topological Model Succinctly (2019) (5)
Range Queries over a Compact Representation of Minimum Bounding Rectangles (2010) (5)
Distributed Generation of Suux Arrays: a Quicksort-based Approach (1997) (5)
Ranked Document Retrieval in (Almost) No Space (2012) (5)
String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings (2005) (5)
Compressed Text Indexing (2008) (5)
Bottom-k document retrieval (2015) (5)
Indexing Highly Repetitive String Collections, Part I (2021) (5)
On Dynamic Succinct Graph Representations (2019) (5)
Indexing Methods for Approximate Text Retrieval (1997) (5)
Self-Index based on LZ77 (thesis) (2011) (5)
Compressing Dynamic Text Collections via Phrase-Based Coding (2005) (5)
Clustering in Metric Spaces with Applications to Information Retrieval (2003) (4)
Smaller and Faster Lempel-Ziv Indices ⋆ (2007) (4)
Near-Optimal Search Time in δ-Optimal Space (2022) (4)
Speeding Up Pattern Matching by Text Sampling (2008) (4)
Efficient Compression and Indexing of Trajectories (2017) (4)
Improved Dynamic Spatial Approximation Trees (2001) (4)
On the Approximation Ratio of Greedy Parsings (2018) (4)
Efficient Compressed Indexing for Approximate Top-k String Retrieval (2014) (4)
Linear time sorting of skewed distributions (1999) (4)
Compressed Dynamic Range Majority Data Structures (2016) (4)
Alphabet Partitioning for Compressed Rank/Select with Applications (2009) (4)
Indexed Hierarchical Approximate String Matching (2008) (4)
Relative Compressed Suffix Trees (2015) (4)
Grammar Compression by Induced Suffix Sorting (2020) (3)
Optimal Top-k Document Retrieval (2013) (3)
Smaller Self-indexes for Natural Language (2012) (3)
Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS (2004) (3)
On the Reproducibility of Experiments of Indexing Repetitive Document Collections (2019) (3)
Contextual Pattern Matching (2020) (3)
Bit-parallel (γ,δ)-matching and suffix automata (2005) (3)
Compressed Indexes for Repetitive Textual Datasets (2019) (3)
k 2-Trees for CompactWebGraphRepresentation (2009) (3)
Two-Dimensional Block Trees (2018) (3)
Improved Compressed String Dictionaries (2019) (3)
Computing MEMs on Repetitive Text Collections (2022) (3)
An efficient implementation of a flexible XPath extension (2010) (3)
Faster Dynamic Compressed d-ary Relations (2019) (3)
Approximate String Matching (2016) (3)
Assembling Omnitigs using Hidden-Order de Bruijn Graphs (2018) (3)
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes (2016) (3)
Top-k Term-Proximity in Succinct Space (2014) (3)
Compressed Vertical Partitioning for Full-In-Memory RDF Management (2013) (3)
Reporting consecutive substring occurrences under bounded gap constraints (2015) (3)
Backwards Search in Context Bound Text Transformations (2011) (3)
Improving semistatic compression via phrase-based modeling (2011) (3)
A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval (2003) (3)
Lempel-Ziv compressed structures for document retrieval (2019) (3)
Efficient construction of the extended BWT from grammar-compressed DNA sequencing reads (2021) (3)
Practical Compact Indexes for Top-k Document Retrieval (2017) (3)
Parallel computation of the Burrows Wheeler Transform in compact space (2020) (3)
Indexing Highly Repetitive String Collections, Part II (2021) (2)
Compressed Dynamic Range Majority and Minority Data Structures (2018) (2)
Matching Numeric Strings under Noise (2003) (2)
Path Queries on Functions (2019) (2)
An index for moving objects with constant-time access to their compressed trajectories (2020) (2)
Tree Path Majority Data Structures (2018) (2)
25 Years of the Burrows-Wheeler Transform (Dagstuhl Seminar 19241) (2019) (2)
Compact Representations of Event Sequences (2018) (2)
Efficient Compressed Wavelet Trees over Large Alphabets (2014) (2)
Algorithms for Transposition Invariant StringMat hing ( Extended Abstra t ) ? (2002) (2)
A Fast Heuristic forApproximate String Matching 2 (1996) (2)
Parallel family trees for transfer matrices in the Potts model (2013) (2)
Optimal Joins Using Compressed Quadtrees (2022) (2)
Fast Compressed Self-indexes with Deterministic Linear-Time Construction (2019) (2)
Adaptive Techniques to find Optimal Planar Boxes (2012) (2)
Combining structural and textual contexts for compressing semistructured databases (2005) (2)
Analyzing Metric Space Indexes: What For? (Invited Paper) (2009) (2)
Fully dynamic and memory-adaptative spatial approximation trees (2003) (2)
Time- and Space-Efficient Regular Path Queries (2022) (2)
SEST L : An Event-Oriented Spatio-Temporal Access Method ⁄ (2006) (2)
LATIN 2016: Theoretical Informatics (2016) (2)
Sequential and indexed two-dimensional pattern matching allowing rotations (2003) (2)
O ( mn log σ ) Time Transposition Invariant LCS Computation (2008) (2)
Self-Indexing XML (2010) (2)
Structure-Based Compression of Complex Massive Data (2008) (2)
Approximate searching on compressed text (2005) (2)
An Optimal Index for PAT Arrays (1996) (2)
Time- and Space-Efficient Regular Path Queries on Graphs (2021) (2)
Simulating the DNA Overlap Graph in Succinct Space (2019) (2)
Simulating the DNA String Graph in Succinct Space (2019) (2)
Indexing Straight-Line Programs ∗ (2008) (2)
Relaxing Wheeler Graphs for Indexing Reads (2018) (2)
On-line approximate string matching with bounded errors (2008) (2)
Faster Attractor-Based Indexes (2018) (2)
A Prototype for Querying over LZCS Transformed Documents (2009) (1)
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances (2021) (1)
Compressed Tree Representations (2016) (1)
Efficient Construction of the BWT for Repetitive Text Using String Compression (2022) (1)
An In-Memory XQuery/XPath Engine over a Compressed Structured Text Representation (2008) (1)
Average-Optimal Multiple Approximate String (2003) (1)
XXS: Efficient XPath Evaluation on Compressed XML Documents (2014) (1)
An Access Method for Objects Moving among Fixed Regions (2008) (1)
IXPN: An Index-Based XPath Implementation (2008) (1)
Proceedings of the 5th international conference on Similarity Search and Applications (2012) (1)
Inverted Treaps (2017) (1)
Space/time-efficient RDF stores based on circular suffix sorting (2020) (1)
Compressed filesystem for managing large genome collections (2019) (1)
Extended string matching (2002) (1)
LATIN 2016: Theoretical Informatics : 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings (2016) (1)
Maximum-Weight Planar Boxes in O(n 2 ) Time (and (2014) (1)
Near-Optimal Search Time in δ -Optimal Space (cid:63) (2022) (1)
Fundamentals of the problem (2010) (1)
Quickheaps : Simple , Efficient , and Cache-Oblivious ⋆ (2007) (1)
Efficient Indexing and Representation of Web Access Logs (2014) (1)
Range Majorities and Minorities in Arrays (2016) (1)
Dynamic Dictionaries in Constant Worst-Case Time (2006) (1)
Parallel Construction of Compact Planar Embeddings (2017) (1)
Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices (2022) (1)
Technical perspective: The compression power of the BWT (2022) (1)
Compact Representation of Spatial Hierarchies and Topological Relationships (2021) (1)
Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), IFIP 19th World Computer Congress, TC-1 Foundations of Computer Science, August 23-24, 2006, Santiago, Chile (2006) (1)
Multiple string matching (2002) (1)
Semantrix: A Compressed Semantic Matrix (2020) (1)
Compressed Vertical Partitioning for Efficient RDF Management 1 (2013) (0)
Front Matter, Table of Contents, Preface, Conference Organization (2018) (0)
Compressed Representations for Web and Social Graphs 1 (2012) (0)
Re-Pair Re-Visited (2007) (0)
SCM : Stru tural Contexts Model for ImprovingCompression in Semistru tured Text Databases ? (2008) (0)
Space-efficient conversions from SLPs (2022) (0)
FASTER THAN FFT : ROTATION INVARIANTCOMBINATORIAL TEMPLATE MATCHINGKimmo Fredriksson (2002) (0)
Mining Compressed Filesystem for Managing Large Genome Collections (2018) (0)
Guest Editorial: Special Issue on Theoretical Informatics (2017) (0)
2010 Proceedings of the 12th Workshop on Algorithm Engineering and Experiments, ALENEX 2010 (2010) (0)
Grammar Compressed Sequences with Rank / Select Support 1 (2019) (0)
Stronger Quickheaps (2011) (0)
L-systems for Measuring Repetitiveness (2022) (0)
Two-Dimensional Block Trees 1 (2021) (0)
Dv2v: A Dynamic Variable-to-Variable Compressor (2019) (0)
Faster Approximate String Matching 1 (0)
Optimized Indirect Binary Search and Text Retrieval (preliminary Version) (2007) (0)
Approximate string matching with Ziv-Lempel compressed indexes (2007) (0)
Exploiting Computation-Friendly Graph Compression Methods (2017) (0)
Proceedings 22nd International Conference of the Chilean Computer Science Society. IEEE Comput. Soc. 2002, pp.7-13. Los Alamitos, CA, USA. (2002) (0)
Storage and Retrieval of Individual Genomes (Extended Abstract) (2008) (0)
An ( other ) Entropy-Bounded Compressed Suffix Tree Fischer (0)
Computation over compressed data (2020) (0)
Relative Suf fi x Trees (0)
Compact Representation of Multi-Granular Topological Hierarchies (2020) (0)
Ziv-Lempel Compressed Full-Text Self-Indexes (0)
Path Queries on Functions 1 (2018) (0)
Stronger Lempel-Ziv Based Compressed Text Indexing (2010) (0)
Regular expression matching (2002) (0)
String Processing and Information Retrieval (2018) (0)
Relative compression of trajectories (2018) (0)
Indexing Compressed (1997) (0)
Predecessor Search (2020) (0)
Compressing Semistructured Text Databases (2003) (0)
Experimental Analysis of a ParallelQuicksort-Based Algorithm for Su x (1998) (0)
Encoding Range Minimum Queries (2013) (0)
A Uniied Model for Similarity Searching ? (1999) (0)
Sequential Approximate String Matching (2008) (0)
Compressing Semistru tured Text Databases ? (2003) (0)
Editorial (2009) (0)
Document Counting in Practice (2014) (0)
Near-Optimal Search Time in $\delta$-Optimal Space, and Vice Versa (2022) (0)
PFP Data Structures (2020) (0)
Cell cycle and protein complex dynamics in discovering signaling pathways (2019) (0)
Proceedings of the Mexican International Conference on Computer Science (2007) (0)
First International Workshop on Similarity Search and Applications, SISAP 2008, Cancun, Quintana Roo, Mexico, 11-12 April 2008 (2008) (0)
Applying the Contexts Model in Semistru turedText Databases ? (2007) (0)
Optimized Binary Search and Text Retrieval 1 (1995) (0)
A Disk-Based Index for Trajectories with an In-Memory Compressed Cache (2021) (0)
TESSELLATIONS OF CUBOIDS WITH STEINER POINTSN (2000) (0)
Improving Text Indexes Using Compressed Permutations (2010) (0)
Compressed Pattern MatchingApproximate Compressed Pattern MatchingDirect Compressed Pattern (2007) (0)
Implementation and Application of Automata in String Processing (2009) (0)
Implicit indexing of natural language text by reorganizing bytecodes (2012) (0)
Universal Compressed Text Indexing 1 (2018) (0)
Proceedings of the 12th international conference on String Processing and Information Retrieval (2005) (0)
Guest Editorial: Special Issue on Compact Data Structures (2017) (0)
Compressed representations for web and social graphs (2013) (0)
The Read-Optimized Burrows-Wheeler Transform (2018) (0)
Navigating planar topologies in near-optimal space and time (2019) (0)
A practical succinct dynamic graph representation (2021) (0)
Current challenges in textual databases (2003) (0)
Pattern Matching (2004) (0)
Message from the SISAP'08 program committee co-chairs (2008) (0)
Bi-Directional r-Indexes (2022) (0)
Lempel–Ziv-Like Parsing in Small Space (2020) (0)
Compressed Data Structures for Suffix Trees Submitted to the University of Chile in Fulfillment of the Thesis Requirement to Obtain the Degree of Msc. in Computer Science (0)
Practical Top-K Document Retrieval in Reduced Space (2011) (0)
Graph Compression for Adjacency-Matrix Multiplication (2022) (0)
Efficient Fully-Compressed Sequence Representations (2012) (0)
Combining Text Compression and String Matching: The Miracle of Self-Indexing (2009) (0)
Engineering Practical Lempel-Ziv Tries (2021) (0)
Correction to: Graph Compression for Adjacency-Matrix Multiplication (2022) (0)
Exact and Approximate Two Dimensional Pattern Matchingallowing RotationsKimmo Fredriksson (2001) (0)
Fast Filters for Two Dimensional String Matching AllowingRotationsKimmo Fredriksson (2000) (0)
XXS (2014) (0)
Storage and Retrieval of Highly Repetitive Sequence Collections Mäkinen (0)
Balancing Run-Length Straight-Line Programs (2022) (0)
A Maple package for semidefinite programming (1996) (0)
Tree-Shape Grammars for Random Access (2019) (0)
Similarity Search and Applications (2012) (0)
Fast Locating with the RLBWT (2017) (0)
Computation over Compressed Structured Data (NII Shonan Meeting 2017-15) (2017) (0)
A More Precise Solution to Two Problems on Tries ( Preliminary Version ) (2008) (0)
Fourth IFIP International Conference on Theoretical Computer Science - TCS 2006: IFIP 19th World Computer Congress, TC-1, Foundations of Computer Science, ... Federation for Information Processing) (2006) (0)

This paper list is powered by the following services:

Other Resources About Gonzalo Navarro

What Schools Are Affiliated With Gonzalo Navarro?

Gonzalo Navarro is affiliated with the following schools:

University of Chile