By Topic

Exact String Matching with Variable Length of Don't Cares based on Suffix Tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chi Wang ; Dept. of Comput. & Inf., Hefei Univ. of Technol., Hefei, China ; Hao Wang ; Zhao Xie ; Jun Gao

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.

Published in:

Information Science and Technology (ICIST), 2011 International Conference on

Date of Conference:

26-28 March 2011