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:
“False history gets made all day, any day,
the truth of the new is never on the news
False history gets written every day
...
the lesbian archaeologist watches herself
sifting her own life out from the shards she’s piecing,
asking the clay all questions but her own.”
—Adrienne Rich (b. 1929)
“The history is always the same the product is always different and the history interests more than the product. More, that is, more. Yes. But if the product was not different the history which is the same would not be more interesting.”
—Gertrude Stein (1874–1946)
“The history of philosophy is to a great extent that of a certain clash of human temperaments.”
—William James (1842–1910)