Variance of the Internal Profile in Suffix Trees
Data Structures and Algorithms
2016-05-16 v2
Abstract
The precise analysis of the variance of the profile of a suffix tree has been a longstanding open problem. We analyze three regimes of the asymptotic growth of the variance of the profile of a suffix tree built from a randomly generated binary string, in the nonuniform case. We utilize combinatorics on words, singularity analysis, and the Mellin transform.
Keywords
Cite
@article{arxiv.1605.03390,
title = {Variance of the Internal Profile in Suffix Trees},
author = {Jeffrey Gaither and Mark Daniel Ward},
journal= {arXiv preprint arXiv:1605.03390},
year = {2016}
}
Comments
19 pages, 0 figures