Associated article: A Practical Suffix-Tree Implementation for String Searches
Published source code accompanying the article by Bogdan Dorohonceanu and Craig Nevill-Manning in which they describe how to build a generalized suffix tree data structure using as little hardware resources as possible while still approaching the time complexity derived in theory. Also see AA700.ZIP.
Algorithm Alley by Bogdan Dorohonceanu and Craig Nevill-Manning Listing One If the inserted suffix is the first suffix in the suffix array then Create the root and add as child a node with a leaf. Else Compute l = longest common ...