History
The concept was first introduced as a position tree by Weiner (1973), which Donald Knuth subsequently characterized as "Algorithm of the Year 1973". The construction was greatly simplified by McCreight (1976), and also by Ukkonen (1995). Ukkonen provided the first online-construction of suffix trees, now known as Ukkonen's algorithm, with running time that matched the then fastest algorithms. These algorithms are all linear-time for a constant-size alphabet, and have worst-case running time of in general.
Farach (1997) gave the first suffix tree construction algorithm that is optimal for all alphabets. In particular, this is the first linear-time algorithm for strings drawn from an alphabet of integers in a polynomial range. Farach's algorithm has become the basis for new algorithms for constructing both suffix trees and suffix arrays, for example, in external memory, compressed, succinct, etc.
Read more about this topic: Suffix Tree
Famous quotes containing the word history:
“I saw the Arab map.
It resembled a mare shuffling on,
dragging its history like saddlebags,
nearing its tomb and the pitch of hell.”
—Adonis [Ali Ahmed Said] (b. 1930)
“All history and art are against us, but we still expect happiness in love.”
—Mason Cooley (b. 1927)
“Jesus Christ belonged to the true race of the prophets. He saw with an open eye the mystery of the soul. Drawn by its severe harmony, ravished with its beauty, he lived in it, and had his being there. Alone in all history he estimated the greatness of man.”
—Ralph Waldo Emerson (1803–1882)