Theoretical Computer Science
Automatic text processing
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Efficient implementation of suffix trees
Software—Practice & Experience
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Information Processing Letters
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Modern Information Retrieval
On Compact Directed Acyclic Word Graphs
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Minimal Forbidden Words and Symbolic Dynamics
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Factor Oracle: A New Structure for Pattern Matching
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
The wide window string matching algorithm
Theoretical Computer Science
Discrete Applied Mathematics
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
Converting suffix trees into factor/suffix oracles
Journal of Discrete Algorithms
Statistical Properties of Factor Oracles
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
From Nerode's congruence to suffix automata with mismatches
Theoretical Computer Science
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics
On the suffix automaton with mismatches
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Statistical properties of factor oracles
Journal of Discrete Algorithms
On the structure of compacted subword graphs of Thue-Morse words and their applications
Journal of Discrete Algorithms
Sturmian graphs and a conjecture of moser
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
| Hi-index | 5.23 |
This article considers several strategies to implement efficiently full indexes on raw textual data. Indexes are based on representations of all the suffixes of the original text, for which we describe three types of implementations aimed at reducing the memory space. The first method is a combination of compaction and minimization that leads to the compact suffix automaton. As a second method we show that considering a complement language can be useful especially when it is related to data compression. Finally, approximation of the set of suffixes is the third technique used to reduce the space of the implementation.