Gonzalo Navarro mainly investigates Theoretical computer science, Algorithm, Data structure, Search engine indexing and Information retrieval. His Theoretical computer science research incorporates elements of Tree structure, String searching algorithm, Suffix tree, Compressed suffix array and Adjacency list. His biological study deals with issues like Approximate string matching, which deal with fields such as String metric.
His Algorithm research incorporates themes from Suffix automaton, Simple, Wavelet Tree and Pattern matching. His Data structure study incorporates themes from Combinatorics, State, Auxiliary memory, Rank and Bitmap. His Information retrieval research is multidisciplinary, incorporating elements of Database and Artificial intelligence.
Gonzalo Navarro mostly deals with Algorithm, Data structure, Combinatorics, Theoretical computer science and Information retrieval. His work in Algorithm tackles topics such as String searching algorithm which are related to areas like Approximate string matching. His research investigates the link between Data structure and topics such as Search engine indexing that cross with problems in Data mining.
His Combinatorics study combines topics in areas such as Space, Entropy, Upper and lower bounds and Discrete mathematics. The various areas that Gonzalo Navarro examines in his Theoretical computer science study include Graph, Succinct data structure, Metric space and Compressed suffix array. Gonzalo Navarro has researched Information retrieval in several fields, including XML, Natural language and Index.
His primary areas of investigation include Data structure, Combinatorics, String, Theoretical computer science and Search engine indexing. His study in the fields of Succinct data structure under the domain of Data structure overlaps with other disciplines such as Space. Gonzalo Navarro interconnects Space and Upper and lower bounds in the investigation of issues within Combinatorics.
The concepts of his String study are interwoven with issues in RDF, Set, Document retrieval, Information retrieval and Listing. Gonzalo Navarro has included themes like Binary relation, Representation, Structure, Rule-based machine translation and Graph in his Theoretical computer science study. His work carried out in the field of Search engine indexing brings together such families of science as Base and Pattern matching.
His primary areas of study are Data structure, Combinatorics, Upper and lower bounds, Theoretical computer science and Binary logarithm. His work deals with themes such as Embedding, Reachability, Planar graph, String and Search engine indexing, which intersect with Data structure. His Search engine indexing research is multidisciplinary, incorporating perspectives in Base, Algorithm and Set.
His Combinatorics study integrates concerns from other disciplines, such as Bounded function, Suffix tree and Constant. His Theoretical computer science study which covers Structure that intersects with Joins and Point. His studies deal with areas such as Space, Parsing and Attractor as well as Binary logarithm.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A guided tour to approximate string matching
ACM Computing Surveys (2001)
Searching in metric spaces
Edgar Chávez;Gonzalo Navarro;Ricardo Baeza-Yates;José Luis Marroquín.
ACM Computing Surveys (2001)
Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences
Gonzalo Navarro;Mathieu Raffinot.
Compressed full-text indexes
Gonzalo Navarro;Veli Mäkinen.
ACM Computing Surveys (2007)
Compressed representations of sequences and full-text indexes
Paolo Ferragina;Giovanni Manzini;Veli Mäkinen;Gonzalo Navarro.
ACM Transactions on Algorithms (2007)
Searching in metric spaces by spatial approximation
string processing and information retrieval (1999)
Indexing methods for approximate string matching
Gonzalo Navarro;Ricardo A. Baeza-Yates;Erkki Sutinen;Jorma Tarhio.
IEEE Data(base) Engineering Bulletin (2001)
Fast and flexible word searching on compressed text
Edleno Silva de Moura;Gonzalo Navarro;Nivio Ziviani;Ricardo Baeza-Yates.
ACM Transactions on Information Systems (2000)
Pivot selection techniques for proximity searching in metric spaces
Benjamin Bustos;Gonzalo Navarro;Edgar Chávez.
Pattern Recognition Letters (2003)
Proximal nodes: a model to query document databases by content and structure
Gonzalo Navarro;Ricardo Baeza-Yates.
ACM Transactions on Information Systems (1997)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: