完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChen, Hong-Binen_US
dc.contributor.authorFu, Hung-Linen_US
dc.contributor.authorHwang, Frank K.en_US
dc.date.accessioned2014-12-08T15:11:27Z-
dc.date.available2014-12-08T15:11:27Z-
dc.date.issued2008-06-01en_US
dc.identifier.issn1862-4472en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s11590-007-0070-5en_US
dc.identifier.urihttp://hdl.handle.net/11536/8780-
dc.description.abstractRecently 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.isoen_USen_US
dc.subjectPooling designsen_US
dc.subjectNonadaptive algorithmsen_US
dc.subjectDisjunct matricesen_US
dc.titleAn upper bound of the number of tests in pooling designs for the error-tolerant complex modelen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s11590-007-0070-5en_US
dc.identifier.journalOPTIMIZATION LETTERSen_US
dc.citation.volume2en_US
dc.citation.issue3en_US
dc.citation.spage425en_US
dc.citation.epage431en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000261234500013-
dc.citation.woscount11-
顯示於類別:期刊論文


文件中的檔案:

  1. 000261234500013.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。