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

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.