A Python implementation of a suffix tree constructed using [Ukkonen's algorithm] 1. A suffix tree is used to find all (potentially overlapping) repeats in a string and Ukkonen's algorithm enables its construction in linear time.
Author: Richard Stebbing
License: MIT (refer to LICENSE)