Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Hong-Bin | en_US |
dc.contributor.author | Fu, Hung-Lin | en_US |
dc.contributor.author | Hwang, Frank K. | en_US |
dc.date.accessioned | 2014-12-08T15:11:27Z | - |
dc.date.available | 2014-12-08T15:11:27Z | - |
dc.date.issued | 2008-06-01 | en_US |
dc.identifier.issn | 1862-4472 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1007/s11590-007-0070-5 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/8780 | - |
dc.description.abstract | Recently pooling designs have been used in screening experiments in molecular biology. In some applications, the property to be screened is defined on subsets of items, instead of on individual items. Such a model is usually referred to as the complex model. In this paper we give an upper bound of the number of tests required in a pooling design for the complex model (with given design parameters) where experimental errors are allowed. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Pooling designs | en_US |
dc.subject | Nonadaptive algorithms | en_US |
dc.subject | Disjunct matrices | en_US |
dc.title | An upper bound of the number of tests in pooling designs for the error-tolerant complex model | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1007/s11590-007-0070-5 | en_US |
dc.identifier.journal | OPTIMIZATION LETTERS | en_US |
dc.citation.volume | 2 | en_US |
dc.citation.issue | 3 | en_US |
dc.citation.spage | 425 | en_US |
dc.citation.epage | 431 | en_US |
dc.contributor.department | 應用數學系 | zh_TW |
dc.contributor.department | Department of Applied Mathematics | en_US |
dc.identifier.wosnumber | WOS:000261234500013 | - |
dc.citation.woscount | 11 | - |
Appears in Collections: | Articles |
Files in This Item:
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.