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:
“... that there is no other way,
That the history of creation proceeds according to
Stringent laws, and that things
Do get done in this way, but never the things
We set out to accomplish and wanted so desperately
To see come into being.”
—John Ashbery (b. 1927)
“The history of the genesis or the old mythology repeats itself in the experience of every child. He too is a demon or god thrown into a particular chaos, where he strives ever to lead things from disorder into order.”
—Ralph Waldo Emerson (18031882)
“Considered in its entirety, psychoanalysis wont do. Its an end product, moreover, like a dinosaur or a zeppelin; no better theory can ever be erected on its ruins, which will remain for ever one of the saddest and strangest of all landmarks in the history of twentieth-century thought.”
—Peter B. Medawar (19151987)