matching statistics for P
ronak66 opened this issue · comments
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
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.