Non-unique probe selection and group testing

Feng Wang, Hongwei David Du, Xiaohua Jia, Ping Deng, Weili Wu, David MacCallum

Research output: Contribution to journalArticle

3 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)29-32
Number of pages4
JournalTheoretical Computer Science
Volume381
Issue number1-3
DOIs
StatePublished - Aug 22 2007
Externally publishedYes

Keywords

  • Group testing
  • Vertex cover
  • d-disjoint matrix
  • over(d, ̄)-separable matrix

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Non-unique probe selection and group testing'. Together they form a unique fingerprint.

  • Cite this

    Wang, F., David Du, H., Jia, X., Deng, P., Wu, W., & MacCallum, D. (2007). Non-unique probe selection and group testing. Theoretical Computer Science, 381(1-3), 29-32. https://doi.org/10.1016/j.tcs.2007.02.067