Clark, David2006-07-282006-07-2819971997http://hdl.handle.net/10012/64Given a text string S = s 1s2s3 •.. sn, we want to preprocess S such that given a pattern P = P1P2P3···Pm, we can find {ilsi·•"i+m-1 = P} as efficiently as possible. Suffix trees are a data structure solution to this problem. Unfortunately, when n is large, the storage required by a suffix tree can be prohibitive. This thesis presents several related new representations for a close relative of the suffix tree, the PAT tree, that retain the functionality of suffix trees while requiring a fraction of the storage used by current methods.application/pdf6702583 bytesapplication/pdfenCopyright: 1997, Clark, David. All rights reserved.Harvested from Collections CanadaDoctoral Thesis