Note: On the complexity of non-unique probe selection

Authors:
Yongxi Cheng;Ker-I Ko;Weili Wu
Affiliations:
Department of Computer Science, Tsinghua University, Beijing 100084, China;Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY 11794-4400, USA;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA
Venue:
Theoretical Computer Science
Year:
2008

Citing 7
Cited 1

The complexity of facets resolved

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Rapid Large-Scale Oligonucleotide Selection for Microarrays

CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
The Minimum Equivalent DNF Problem and Shortest Implicants

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Group Testing With DNA Chips: Generating Designs and Decoding Experiments

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Optimal robust non-unique probe selection using Integer Linear Programming

Bioinformatics

Optimal decoding and minimal length for the non-unique oligonucleotide probe selection problem

Neurocomputing

Quantified Score

Hi-index	5.23

Visualization

Abstract

We investigate the computational complexity of some basic problems regarding non-unique probe selection using separable matrices. In particular, we prove that the minimal d@?-separable matrix problem is DP-complete, and the d@?-separable submatrix with reserved rows problem, which is a generalization of the decision version of the minimum d@?-separable submatrix problem, is @S"2^P-complete.