Searching a pattern Indirected binary search on SA: O(p) time per suffix cmp T = mississippi# SA 12 11 8 5 2 1 10 9 7 4 6 3 P = si P is smaller Suffix Array search O (log 2 N) binary-search steps Each step takes O(p) char cmp  overall, O (p log 2 N) time
{}