Non-unique probe selection and group testing

DOI10.1016/J.TCS.2007.02.067zbMATH Open1188.68360OpenAlexW2039650575WikidataQ60402743 ScholiaQ60402743MaRDI QIDQ995556FDOQ995556

Authors: Feng Wang, Hongwei Du, Ping Deng, Weili Wu, David Maccallum, X.-H. 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

Recommendations

• On the complexity and approximation of non-unique probe selection using \(d\)-disjunct matrix
• On the complexity of non-unique probe selection
• Integer linear programming approaches for non-unique probe selection
• Tight approximability results for test set problems in bioinformatics
• scientific article; zbMATH DE number 2038701

zbMATH Keywords

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

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cites Work

• Title not available (Why is that?)
• Approximation algorithms for the test cover problem
• Title not available (Why is that?)
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Title not available (Why is that?)
• Tight approximability results for test set problems in bioinformatics

Cited In (5)

• On optimal randomized group testing with one defective item and a constrained number of positive responses
• Informative group testing for multiplex assays
• Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
• On the complexity and approximation of non-unique probe selection using \(d\)-disjunct matrix
• On the complexity of non-unique probe selection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995556)