摘要： 后缀数组构建算法的时间和空间开销是它在实际应用中的瓶颈。该文介绍了两种较好的构建算法，对它们的性能作了评估和分析，指出了各自的适用范围，给出并比较了两种算法在不同情况下的实验结果。
关键词:
全文检索,
后缀数组,
后缀树,
线性时间
Abstract: The time and space consuming in the construction of the suffix array is always the bottleneck in practical uses. This paper introduces two preferable construction algorithms, analyses and evaluates them from performance aspect and points out their applicable scope, gives and compaes experiment results of two algorithms in different condition.
Key words:
Full text index,
Suffix array,
Suffix tree,
Linear time
杨笑天;陶晓鹏. 后缀数组创建算法的分析和比较[J]. 计算机工程, 2007, 33(03): 186-188.
YANG Xiaotian; TAO Xiaopeng. Comparison and Analysis of Construction Algorithm for Suffix Array[J]. Computer Engineering, 2007, 33(03): 186-188.