Suffix tree Guide, Meaning , Facts, Information and Description

The suffix tree data structure was first described by E.M. McCreight in 1976. With it a large text can be searched very quickly. Since searching is so fast, it can also be used to find repeated patterns in a text. Therefore, variants of the LZW compression schemes use it (LZSS). A suffix tree is similar to a trie where the paths between nodes without children have been merged into a single edge. Suffix trees are useful for string matching applications, such as those that arise when working with DNA sequences.

References

• E.M. McCreight. (1976). A space-economical suffix tree construction algorithm. Journal of the ACM 23 262-272.
• E. Ukkonen. (1995). On-line construction of suffix trees. Algorithmica 14(3):249-260.

External link

• NIST's Dictionary of Algorithms and Data Structures: Suffix Tree

This is an Article on Suffix tree. Page Contains Information, Facts Details or Explanation Guide About Suffix tree

	Web www.E-paranoids.com