Non-unique probe selection and group testing

DOI10.1016/j.tcs.2007.02.067zbMath1188.68360OpenAlexW2039650575WikidataQ60402743 ScholiaQ60402743MaRDI QIDQ995556

David Maccallum, Ping Deng, Feng Wang, Hongwei David Du, Weili Wu, Xiao-Hua Jia

Publication date: 3 September 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.067

zbMATH Keywords

group testingvertex cover\(\bar d\)-separable matrix\(d\)-disjoint matrix

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (2)

Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ On optimal randomized group testing with one defective item and a constrained number of positive responses

Cites Work

• Approximation algorithms for the test cover problem
• Tight approximability results for test set problems in bioinformatics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-unique probe selection and group testing