Optimized implementation of suffix tree in python using Ukkonen's algorithm.
This module is an optimized implementation of Ukkonen's suffix tree algorithm in python which will be having most of the important text processing functionalities such as:
✓
Check if a string P of length m is a substring in O(m) time.
✓
Find the first occurrence of the patterns P1,... ,Pq of total length m as substrings in O(m) time.
✓
Find all z occurrences of the patterns P1,... ,Pq of total length m as substrings in O(m+z) time.