@article {10.3844/jcssp.2007.924.933,
article_type = {journal},
title = {A New Algorithm for Subset Matching Problem},
author = {Chen, Yangjun},
volume = {3},
number = {12},
year = {2007},
month = {Dec},
pages = {924-933},
doi = {10.3844/jcssp.2007.924.933},
url = {https://thescipub.com/abstract/jcssp.2007.924.933},
abstract = {The 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 set t[i + j - 1], for all j (1 ≤ j≤ m). This is a generalization of the ordinary string matching and can be used for finding matching subtree patterns. In this research, we propose a new algorithm that needs O(n.m) time in the worst case. But its average time complexity is O(n + m.nlog1.5).},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}