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:
“In all history no class has been enfranchised without some selfish motive underlying. If to-day we could prove to Republicans or Democrats that every woman would vote for their party, we should be enfranchised.”
—Carrie Chapman Catt (1859–1947)
“They are a sort of post-house,where the Fates
Change horses, making history change its tune,
Then spur away o’er empires and o’er states,
Leaving at last not much besides chronology,
Excepting the post-obits of theology.”
—George Gordon Noel Byron (1788–1824)
“The history of mankind interests us only as it exhibits a steady gain of truth and right, in the incessant conflict which it records between the material and the moral nature.”
—Ralph Waldo Emerson (1803–1882)