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:

    The history of medicine is the history of the unusual.
    Robert M. Fresco, and Jack Arnold. Prof. Gerald Deemer (Leo G. Carroll)

    There is a constant in the average American imagination and taste, for which the past must be preserved and celebrated in full-scale authentic copy; a philosophy of immortality as duplication. It dominates the relation with the self, with the past, not infrequently with the present, always with History and, even, with the European tradition.
    Umberto Eco (b. 1932)

    In the history of the human mind, these glowing and ruddy fables precede the noonday thoughts of men, as Aurora the sun’s rays. The matutine intellect of the poet, keeping in advance of the glare of philosophy, always dwells in this auroral atmosphere.
    Henry David Thoreau (1817–1862)