Suffix Trie

A suffix trie is a trie which contains all the suffices of a string. The root node is special, not representing a letter. Then, each node is one letter and any simple path from root to leaf is a suffix of the array. These can use up to O(N^2) space, however, so use of a suffix tree is generally better.

page_revision: 0, last_edited: 1199560845|%e %b %Y, %H:%M %Z (%O ago)
EditRate (0)Tags History Files Print Site tools+ Options
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License