Non-unique probe selection and group testing
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 29-32 |
Journal / Publication | Theoretical Computer Science |
Volume | 381 |
Issue number | 1-3 |
Publication status | Published - 22 Aug 2007 |
Link(s)
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. © 2007 Elsevier Ltd. All rights reserved.
Research Area(s)
- d-disjoint matrix, Group testing, over(d, ̄)-separable matrix, Vertex cover
Citation Format(s)
Non-unique probe selection and group testing. / Wang, Feng; David Du, Hongwei; Jia, Xiaohua et al.
In: Theoretical Computer Science, Vol. 381, No. 1-3, 22.08.2007, p. 29-32.
In: Theoretical Computer Science, Vol. 381, No. 1-3, 22.08.2007, p. 29-32.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review