search

kasravnd / SuffixTree

Optimized implementation of suffix tree in python using Ukkonen's algorithm.
51 stars 17 forks source link

matching statistics for P #3

Open ronak66 opened 3 years ago

ronak66 commented 3 years ago

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 time. This is termed the matching statistics for P

ronak66 commented 3 years ago

Can you please provide an example to perform the above task of finding the presence of the longest prefix of a pattern in the suffix tree.