As a data structure, the suffix tree was first presented to support the string matching and queries, for instance: searching the maximum repetition substring, matching of the similar strings, stings comparisons etc.

• 后缀树作为一种数据结构,最早是为支持有效的字符串匹配和查询而提出的,例如:寻找最长的重复子串,相似串的匹配,串比较等问题。