By Topic

On the complexity of finding emerging patterns

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)
Lusheng WAng ; Dept. of Comput. Sci., Hong Kong Univ., China ; Hao Zhao ; Guozhu Dong ; Jianping Li

Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful for capturing interactions among genes (or other biological entities), for capturing signature patterns for disease subtypes, and deriving potential disease treatment plans, etc. We study the complexity of finding emerging patterns (with the highest frequency). We first show that the problem is MAX SNP-hard. This implies that polynomial time approximation schemes do not exist for the problem unless P = NP. We then prove that for any constant δ < 1, the emerging pattern problem cannot be approximated within ratio 2logδ in polynomial time unless NP ⊆ DTIME[2polylogn], where n is the number of positions in a pattern.

Published in:

Computer Software and Applications Conference, 2004. COMPSAC 2004. Proceedings of the 28th Annual International  (Volume:2 )

Date of Conference:

28-30 Sept. 2004