DocumentCode
3112284
Title
Exact String Matching with Variable Length of Don´t Cares based on Suffix Tree
Author
Wang, Chi ; Wang, Hao ; Xie, Zhao ; Gao, Jun
Author_Institution
Dept. of Comput. & Inf., Hefei Univ. of Technol., Hefei, China
fYear
2011
fDate
26-28 March 2011
Firstpage
109
Lastpage
113
Abstract
Focusing on the case that the efficiency of exact string matching with Variable Length of Don´t Cares (VLDC for short) is not satisfying, we employ the special Trie structure of suffix tree for exact string matching and present a novel method as exact String Matching with VLDC using Suffix Tree (SMST). Comparing with some traditional algorithms in experiments, SMST can not only generate correct results, but also reduce the searching time-cost more greatly when the number of patterns increases.
Keywords
string matching; trees (mathematics); exact string matching; suffix tree; variable length of dont cares; Approximation algorithms; Arrays; Computers; Electronic mail; Heuristic algorithms; Pattern matching;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Science and Technology (ICIST), 2011 International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4244-9440-8
Type
conf
DOI
10.1109/ICIST.2011.5765221
Filename
5765221
Link To Document