CentralNotice Suffix tree From Wikipedia, the free encyclopedia Jump to: navigation , search Suffix tree for the text BANANA . Each substring is terminated with special character $ . The six paths from the root to a leaf (shown as boxes) correspond to the six suffixes A$ , NA$ , ANA$ , NANA$ , ANANA$ and BANANA$ . The numbers in the leaves give the start position of the corresponding suffix. Suffix links, drawn dashed, are used during construction. 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 takes time and space linear in the length of . Once constructed,...