View Document Preview and Link Document Date: 2002-10-23 23:03:02 Open Document File Size: 506,62 KB Share Result on Facebook
Company AT&T / / Facility University of Waterloo / Computer Science University of Arizona Tucson / / IndustryTerm suffix sorting algorithm / provable efficient algorithm / Search times / search paradigm / space expensive algorithm / on-line string / classic binary search / expected-time algorithm / string sorting algorithm / on-line string search / binary search / sublinear approximate matching algorithm / on-line construction / search loop / on-line string searches / computing / precise search algorithm / binary search step / search algorithm / simpler algorithm / search time / on-line string searching / / Organization Computer Science University of Arizona Tucson / National Institute of Health / National Science Foundation / Udi Manber1 Gene Myers2 Department / University of Waterloo / / Position head / / Product Galil / / ProvinceOrState Arizona / / Technology augmented algorithm / expected-time algorithm / sorting algorithm / search algorithm / space expensive algorithm / string sorting algorithm / simpler algorithm / suffix sorting algorithm / sublinear approximate matching algorithm / precise search algorithm / / SocialTag 
Suffix arrays: A new method for on-line string searches Udi Manber1 Gene Myers2 Department of Computer Science