论文信息 - The k-FEATURE SET problem is W[2]-complete

The k-FEATURE SET problem is W[2]-complete

We prove the W[2]-completeness of the feature subset selection problem when the cardinality of the subset is the parameter. Aside from the many applications the problem has in data mining literature, the problem is highly relevant in Computational Biology since it arises in differential gene expression analysis using microarray technologies. It is also related to genetic-based prognosis and regulatory interaction discovery using DNA chip technologies.

Pablo Moscato | Carlos Cotta

[1] Pablo Moscato,et al. A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.

[2] Michael R. Fellows,et al. FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[3] J Marx,et al. DNA Arrays Reveal Cancer in Its Many Forms , 2000, Science.

[4] Sayan Mukherjee,et al. Feature Selection for SVMs , 2000, NIPS.

[5] Satoru Miyano,et al. Algorithms for Identifying Boolean Networks and Related Biological Networks Based on Matrix Multiplication and Fingerprint Function , 2000, J. Comput. Biol..

[6] Michael R. Fellows,et al. Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.

[7] E V Koonin. The emerging paradigm and open problems in comparative genomics. , 1999, Bioinformatics.

[8] Stuart J. Russell,et al. NP-Completeness of Searches for Smallest Possible Feature Sets , 1994 .

[9] J. Trent,et al. Microarrays and toxicology: The advent of toxicogenomics , 1999, Molecular carcinogenesis.

[10] Michael R. Fellows,et al. Parameterized Complexity , 1998 .

[11] V. Thorsson,et al. Discovery of regulatory interactions through perturbation: inference and experimental design. , 1999, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[12] John C. Wooley. Trends in computational biology. , 1999, RECOMB 1999.

[13] John C. Wooley. Trends in Computational Biology: A Summary Based on a RECOMB Plenary Lecture, 1999 , 1999, J. Comput. Biol..