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:
“What we call National-Socialism is the poisonous perversion of ideas which have a long history in German intellectual life.”
—Thomas Mann (1875–1955)
“This is the greatest week in the history of the world since the Creation, because as a result of what happened in this week, the world is bigger, infinitely.”
—Richard M. Nixon (1913–1995)
“The history of the world is none other than the progress of the consciousness of freedom.”
—Georg Wilhelm Friedrich Hegel (1770–1831)