Autocorrelation on words and its applications: analysis of suffix trees by string-ruler approach
Journal of Combinatorial Theory Series A
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Compror: on-line lossless data compression with a factor oracle
Information Processing Letters
Reducing space for index implementation
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
Using Factor Oracles for Machine Improvisation
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Converting suffix trees into factor/suffix oracles
Journal of Discrete Algorithms
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
| Hi-index | 0.00 |
Factor and suffix oracles have been introduced in Allauzen et al. (1999) [1] in order to provide an economic and efficient solution for storing all the factors and suffixes respectively of a given text. Whereas good estimations exist for the size of the factor/suffix oracle in the worst case, no average-case analysis has been done until now. In this paper, we give an estimation of the average size for the factor/suffix oracle of an n-length text when the alphabet size is 2 and under a Bernoulli distribution model with parameter 1/2. To reach this goal, a new oracle is defined, which shares many of the properties of a factor/suffix oracle but is easier to study and provides an upper bound of the average size we are interested in. Our study introduces tools that could be further used in other average-case analysis on factor/suffix oracles, for instance when the alphabet size is arbitrary.