Suffix trees for very large inputs

This work designs a new algorithm DiGeST which improves significantly over previous work in reducing random access to the suffix tree and performing only two passes over disk data, and presents another suffix tree construction algorithm, B2ST that is able to construct suffix trees for input sequences significantly larger than the size of the available main memory.