## 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 language | English (US) |
---|---|

Pages (from-to) | 29-32 |

Number of pages | 4 |

Journal | Theoretical Computer Science |

Volume | 381 |

Issue number | 1-3 |

DOIs | |

State | Published - Aug 22 2007 |

Externally published | Yes |

## Keywords

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

## ASJC Scopus subject areas

- Theoretical Computer Science
- General Computer Science