Full metadata record
DC FieldValueLanguage
dc.contributor.authorHwang, FKen_US
dc.contributor.authorLiu, YCen_US
dc.date.accessioned2014-12-08T15:41:33Z-
dc.date.available2014-12-08T15:41:33Z-
dc.date.issued2003en_US
dc.identifier.issn1066-5277en_US
dc.identifier.urihttp://hdl.handle.net/11536/28256-
dc.identifier.urihttp://dx.doi.org/10.1089/106652703321825982en_US
dc.description.abstractPooling designs are used in clone library screening to efficiently distinguish positive clones from negative clones. Mathematically, a pooling design is just a nonadaptive group testing scheme which has been extensively studied in the literature. In some applications, there is a third category of clones called "inhibitors" whose effect is to neutralize positives. Specifically, the presence of an inhibitor in a pool dictates a negative outcome even though positives are present. Sequential group testing schemes, which can be modified to three-stage schemes, have been proposed for the inhibitor model, but it is unknown whether a pooling design (a one-stage scheme) exists. Another open question raised in the literature is whether the inhibitor model can treat unreliable pool outcomes. In this paper, we answer both open problems by giving a pooling design, as well as a two-stage scheme, for the inhibitor model with unreliable outcomes. The number of pools required by our schemes are quite comparable to the three-stage scheme.en_US
dc.language.isoen_USen_US
dc.subjectnonadaptive group testingen_US
dc.subjectinhibitorsen_US
dc.subjecterror-toleranten_US
dc.titleError-tolerant pooling designs with inhibitorsen_US
dc.typeArticleen_US
dc.identifier.doi10.1089/106652703321825982en_US
dc.identifier.journalJOURNAL OF COMPUTATIONAL BIOLOGYen_US
dc.citation.volume10en_US
dc.citation.issue2en_US
dc.citation.spage231en_US
dc.citation.epage236en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000182985200008-
dc.citation.woscount12-
Appears in Collections:Articles


Files in This Item:

  1. 000182985200008.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.