Question: Longest common extension. Given two strings S1 and S2 , find the length of the longest substring of S1 beginning at i that matches substring
Longest common extension. Given two strings S1 and S2 , find the length of the longest substring of S1 beginning at i that matches substring S2 beginning at j using suffix trees. Show that this can be completed in O(n) time and O(1) query time.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
