Suffix Tree Structure

From GM-RKB
(Redirected from Suffix Tree)
Jump to navigation Jump to search

A Suffix Tree Structure is a tree data structure that contains all the suffixes of the given token string as their keys and positions in the text as their values.



References

2016

  • (Wikipedia, 2016) ⇒ http://wikipedia.org/wiki/suffix_tree Retrieved:2016-3-28.
    • In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the given text as their keys and positions in the text as their values. Suffix trees allow particularly fast implementations of many important string operations.

      The construction of such a tree for the string [math]\displaystyle{ S }[/math] takes time and space linear in the length of [math]\displaystyle{ S }[/math] . Once constructed, several operations can be performed quickly, for instance locating a substring in [math]\displaystyle{ S }[/math] , locating a substring if a certain number of mistakes are allowed, locating matches for a regular expression pattern etc. Suffix trees also provide one of the first linear-time solutions for the longest common substring problem. These speedups come at a cost: storing a string's suffix tree typically requires significantly more space than storing the string itself.


1976

1973

  • (Weiner, 1973) ⇒ P. Weiner (1973). “Linear pattern matching algorithm.” In: Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory. doi:10.1109/SWAT.1973.13.