Suffix Arrays A new method for online string searches后缀数组的一种新方法用于在线字符串检索.pptVIP

Suffix Arrays:A new method for on-linestring searches Udi Manber Gene Myers Introduction Suffix Array: Lexicographically sorted list of all suffixes of text A Pattern matching problem: Find all instances of string W in large text A N – length of text A P – length of string W Over an alphabet Suffix Trees vs. Suffix Arrays Query: “Is W a substring of A?” Suffix Tree: O(Plog| |) with O(N) space, or: O(P) with O(Nlog| |) space (impractical) Suffix Array: Competitive/better O(P+logN) search Main advantage: Space: 2N integers (In practice, problem is space overhead of query data structure)