Suffix Tree - History

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:

    History does nothing; it does not possess immense riches, it does not fight battles. It is men, real, living, who do all this.... It is not “history” which uses men as a means of achieving—as if it were an individual person—its own ends. History is nothing but the activity of men in pursuit of their ends.
    Karl Marx (1818–1883)

    Yet poetry, though the last and finest result, is a natural fruit. As naturally as the oak bears an acorn, and the vine a gourd, man bears a poem, either spoken or done. It is the chief and most memorable success, for history is but a prose narrative of poetic deeds.
    Henry David Thoreau (1817–1862)

    The history of any nation follows an undulatory course. In the trough of the wave we find more or less complete anarchy; but the crest is not more or less complete Utopia, but only, at best, a tolerably humane, partially free and fairly just society that invariably carries within itself the seeds of its own decadence.
    Aldous Huxley (1894–1963)