Revision as of 14:22, 4 October 2006 edit 195.176.176.226 (talk) →Applications: explain o(m+log n) algorithm ← Previous edit		Revision as of 14:24, 4 October 2006 edit undo 195.176.176.226 (talk) →Applications: explain o(m+log n) algorithm Next edit →
Line 36: * Find the last suffix lying between ''a'' and ''adabra'' whose second character is ''b'' (''abracadabra'') * Find the first suffix lying between ''abra'' and ''abracadabra'' whose third character is ''r'' * Find the ~~first~~last suffix lying between ''abra'' and ''abracadabra'' whose third character is ''r'' * Keep doing the same until the range restricts to a single suffix (in this case at ''abrac'') * Check the remaining characters of the suffix (''adabra'') match the remaining characters of the requested string (''ad'')

Suffix array: Difference between revisions