Non-unique probe selection and group testing

Authors:
Feng Wang;Hongwei David Du;Xiaohua Jia;Ping Deng;Weili Wu;David MacCallum
Affiliations:
Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, USA;Department of Computer Science, City University of Hong Kong, China;Department of Computer Science, City University of Hong Kong, China;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, USA
Venue:
Theoretical Computer Science
Year:
2007

Citing 3
Cited 1

Algorithms for choosing differential gene expression experiments

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Group Testing With DNA Chips: Generating Designs and Decoding Experiments

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Tight approximability results for test set problems in bioinformatics

Journal of Computer and System Sciences

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

Neurocomputing

Quantified Score

Hi-index	5.23

Visualization

Abstract

A minimization problem that has arisen from the study of non-unique probe selection with group testing technique is as follows: Given a binary matrix, find a d-disjunct submatrix with the minimum number of rows and the same number of columns. We show that when every probe hybridizes to at most two viruses, i.e., every row contains at most two 1s, this minimization is still MAX SNP-complete, but has a polynomial-time approximation with performance ratio 1+2/(d+1). This approximation is constructed based on an interesting result that the above minimization is polynomial-time solvable when every probe hybridizes to exactly two viruses.