Parallel Processing of String Search using Suffix Tree on Multi-core CPU
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 Young Researchers' Workshop Proceedings = 2012 IEEE SMC Hiroshima Chapter 若手研究会講演論文集
IEEE SMC Hiroshima Chapter
©Copyright by IEEE SMC Hiroshima Chapter. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting
republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
2012 IEEE SMC Hiroshima Chapter若手研究会, 2012年7月14日, 広島市立大学