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:
“Indeed, the Englishman’s history of New England commences only when it ceases to be New France.”
—Henry David Thoreau (1817–1862)
“I am not a literary man.... I am a man of science, and I am interested in that branch of Anthropology which deals with the history of human speech.”
—J.A.H. (James Augustus Henry)
“If you look at the 150 years of modern China’s history since the Opium Wars, then you can’t avoid the conclusion that the last 15 years are the best 15 years in China’s modern history.”
—J. Stapleton Roy (b. 1935)