SuffixTree
SuffixTree copied to clipboard
Optimized implementation of suffix tree in python using Ukkonen's algorithm.
How to perform: Find for each suffix of a pattern P the length of the longest match between a prefix of P[i... m] and a substring in D in image...
Wanted to raise this Exception I came across using just the `suffix_tree.py` file, and adding the following code block for testing: ``` if __name__=="__main__": tree = SuffixTree("abca$") tree.print_dfs() ```` Note...
At first I thought the problem only occurred when findall was set to True, until I got a wrong result when set to Falso too. - In "test.py", setting s...