By Topic

On the Subset Matching

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
$33 $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

1 Author(s)
Yangjun Chen ; University of Winnipeg, Canada

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 location 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 leqslant j leqslant m). This is an extension of the classic string matching and can be used for finding matching subtree patterns. In this paper, we propose a new algorithm and conduct a probabilistic analysis of its performance, which shows that we need only O(n + m cdot n^{0.5} ) time to solve the problem on average.

Published in:

2006 Seventh International Conference on Web-Age Information Management Workshops

Date of Conference:

June 2006