suffix tree 中文意思是什麼
suffix tree
解釋
后綴樹-
The second part includes the index of child suffix tree, and some other information for finding the location of every child suffix tree in disk quickly
第二部分是索引部分，包括子后綴樹的索引和其他信息。利用這部分信息，可以快速定位每棵子后綴樹在磁盤中的位置。 -
According to different storage methods of child suffix tree, we introduce several searching technology
根據不同的子后綴樹存儲方法，本文介紹了多種搜索方法。 -
This index is based on suffix tree, and is divided into some layers. a layer usually includes some child suffix trees
分層索引結構是基於后綴樹的，它由若干層組成，通常情況下，每一層又包括若干棵子后綴樹。 -
The construction algorithm embodies three parts that are suffix sorting, logest common prefix evaluation process and child suffix tree construction
整個建立演算法包括三個部分:后綴排序，計算最短公共前綴和建立子后綴樹。 -
The storage of index is divided into two parts. the first part is the information of each child suffix tree. child suffix tree can be represented by several methods which require different storage space
在存儲策略上，本文把整個索引劃分為兩部分:第一部分保存子后綴樹的信息，子后綴樹可以採用多種不同的優化方法存儲，每種方法所需的存儲空間和性能均不相同。 -
The sequences are transformed to a relative sequence, in which all the segments are normalized by the previous segment. the relative sequences are categorized and indexed by suffix tree, and the result of the suffix tree search is the potential similar subsequences
通過將序列變換為相對序列，實現了對序列中任意位置、任意長度子序列的規范化；為了提高查詢效率，將相對序列的特徵向量進行離散化分類，並使用后綴樹進行索引。 -
Suffix tree is a good index structure for smaller sequences, but it not suit large sequences, due to the so - called “ memory bottleneck ”. the suffix array is the closest competing structure, as it needs less space than a suffix tree. however, it is not convenient for searching
對于較小的序列來說，后綴樹索引無疑是一種很好的解決辦法，但由於它產生了「內存瓶頸」 ，不適合大的序列;后綴數組是另一種最具有競爭力的索引結構，與后綴樹相比，它需更少的存儲空間，但在數據搜索方面卻效率較低;基於q - gram和q - sample的索引方法雖然能用於快速搜索，但是不能用於搜索相似度低的數據。
分享友人