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:
“It may be well to remember that the highest level of moral aspiration recorded in history was reached by a few ancient Jews—Micah, Isaiah, and the rest—who took no count whatever of what might not happen to them after death. It is not obvious to me why the same point should not by and by be reached by the Gentiles.”
—Thomas Henry Huxley (1825–95)
“A people without history
Is not redeemed from time, for history is a pattern
Of timeless moments.”
—T.S. (Thomas Stearns)
“Hence poetry is something more philosophic and of graver import than history, since its statements are rather of the nature of universals, whereas those of history are singulars.”
—Aristotle (384–322 B.C.)