A Note on the Height of Suffix Trees


Consider a word in which the individual symbols are independent integers occurring with probabilities Pi. and let Hn be the height of the suffix tree constructed from the first n suffixes of this word. We show that Hn is asymptotically close to 2 log n/log(lt~pr) in many • respects: the difference is 0 (log log n) in probability, and the ratio tends to one… (More)
DOI: 10.1137/0221005