suffixtreesandarrays.pptVIP

Suffix array construction Naive in place construction Similar to insertion sort Insert all the suffixes into the array one by one making sure that the new inserted suffix is in its correct place Running time complexity: O(m2) where m is the length of the string Manber and Myers give a O(m log m) construction in their 1993 paper. Suffix arrays O(n) space where n is the size of the database string Space efficient. However, there’s an increase in query time Lookup query Binary search O(m log n) time; m is the size of the query Can reduce time to O(m + log n) using a more efficient implementation