An implementation of Farach's algorithm for constructing Suffix Trees in linear time for integer alphabets - View it on GitHub