Research ArticleOpen accessIn the keywordsA New Algorithm for Subset Matching ProblemYangjun ChenThe subset matching problem is to find all occurrences of a pattern string p of length m in a text string t of length n, where each pattern and text position is a set of characters drawn from some alphabet ∑. The pattern is said to occur at text position i if the set p[j] is a subset of the … …Journal of Computer Science, Vol. 3, Issue 12 · 31 Dec 2007 · 6,737 accessesView PDFCite