Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Complexity Aspects of Image Classification
Medical Imaging and Informatics
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Specifying evolutionary algorithms in XML
IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Hi-index | 0.00 |
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.