Correspondence To Suffix Trees
Suffix arrays are closely related to suffix trees:
- Suffix arrays can be constructed by performing a depth-first traversal of a suffix tree. The suffix array corresponds to the leaf-labels given in the order in which these are visited during the traversal, if edges are visited in the lexicographical order of their first character.
- A suffix tree can be constructed in linear time by using a combination of suffix and LCP array. For a description of the algorithm, see the corresponding section in the LCP array article.
It has been shown that every suffix tree algorithm can be systematically replaced with an algorithm that uses a suffix array enhanced with additional information (such as the LCP array) and solves the same problem in the same time complexity. Advantages of suffix arrays over suffix trees include improved space requirements, simpler linear time construction algorithms (e.g., compared to Ukkonen's algorithm) and improved cache locality.
Read more about this topic: Suffix Array
Famous quotes containing the word trees:
“They are very proper forest houses, the stems of the trees collected together and piled up around a man to keep out wind and rain,—made of living green logs, hanging with moss and lichen, and with the curls and fringes of the yellow birch bark, and dripping with resin, fresh and moist, and redolent of swampy odors, with that sort of vigor and perennialness even about them that toadstools suggest.”
—Henry David Thoreau (1817–1862)