[ English / Japanese ] SUFARY HOME PAGE

SUFARY Manual

Last Modified: 1999-10-18

Yamasita, Tatuo

What is SUFARY?

SUFARY is a package of libraries using the Suffix array [1]. The Suffix array is a string indexing structure and memory efficient alternative of the Suffix tree. The Suffix array is a sorted list of all the suffixes of a text. The construction of the suffix array requires O(N log N) time in the worst case, where N is a length of the text. Any strings (suffixies) can be found in O(P log N) time with a simple binary search, where P is a length of a keyword.

  1. Udi Manber and Gene Myers, "Suffix arrays: A new method for on-line string searches", 1st ACM-SIAM Symposium on Discrete Algorithms, pp.319-327, 1990.

Table of Contents


tatuo-y@is.aist-nara.ac.jp