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:
“Universal history is the history of a few metaphors.”
—Jorge Luis Borges (1899–1986)
“I believe that in the history of art and of thought there has always been at every living moment of culture a “will to renewal.” This is not the prerogative of the last decade only. All history is nothing but a succession of “crises”Mof rupture, repudiation and resistance.... When there is no “crisis,” there is stagnation, petrification and death. All thought, all art is aggressive.”
—Eugène Ionesco (b. 1912)
“The best history is but like the art of Rembrandt; it casts a vivid light on certain selected causes, on those which were best and greatest; it leaves all the rest in shadow and unseen.”
—Walter Bagehot (1826–1877)