suffix-tree

基本解释

We propose a text vector space model (VSM) based on suffix tree and implement a text categorizing system on the model.
摘要本文在面向网络内容分析的前提下，提出了一种基于后缀树的文本向量空间模型(VSM)，并在此模型之上实现了文本分类系统。
High-frequency words extracting algorithm based on suffix tree is used to extract content features of items and the use of thesaurus can be avoided.
采用基于前缀树的高频词抽取算法抽取试题的内容特征，避免了对同义词典的依赖。
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.
后缀树作为一种数据结构,最早是为支持有效的字符串匹配和查询而提出的,例如:寻找最长的重复子串,相似串的匹配,串比较等问题。
Mining algorithm of Web access patterns based on suffix tree
一种基于后缀树的Web访问模式挖掘算法
A Local Alignment Algorithm Implemented with Inter-Related Suffix Tree Model
用互关联后继树模型实现一个局部相似性比对算法