A suffix tree is the index structure of n-ary tree structure which represented as a tree structure of the suffix string. It is widely used in including bioinformatics, to search engines and data clustering, because it is an index structure that can process string fast and efficiently in string　databases. In recent years, an efficient construction of suffix tree and speed up the search process a string using suffix tree has become an import ant issue, because the number and size of the data　string that is stored in the string databases has been large-scale. This paper focuses on the processing　speed search a string using suffix tree, we propose a parallel processing of the search in the suffix tree　based on multi-core CPU.

2012 IEEE SMC Hiroshima Chapter若手研究会, 2012年7月14日, 広島市立大学