完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHwang, F. K.en_US
dc.contributor.authorChang, F. H.en_US
dc.date.accessioned2014-12-08T15:13:08Z-
dc.date.available2014-12-08T15:13:08Z-
dc.date.issued2007-11-01en_US
dc.identifier.issn0022-0000en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.jcss.2007.03.005en_US
dc.identifier.urihttp://hdl.handle.net/11536/10132-
dc.description.abstractIn using pooling designs to identify clones containing a specific subsequence called positive clones, sometimes there exist nonpositive clones which can cancel the effect of positive clones. Various models have been studied which differ in the power of cancellation. Although the various models pose interesting mathematical problems, and ingenious constructions of pooling designs have been proposed, in practice we rarely are sure about the true model and thus about which pooling design to use. In this paper we give a pooling design which fits all inhibitor models, and does not use more tests than in the more specific models. In particular, we obtain a I-round pooling design for the k-inhibitor model for which only sequential designs are currently known. (c) 2007 Elsevier Inc. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectpooling designen_US
dc.subjectinhibitoren_US
dc.titleThe identification of positive clones in a general inhibitor modelen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.jcss.2007.03.005en_US
dc.identifier.journalJOURNAL OF COMPUTER AND SYSTEM SCIENCESen_US
dc.citation.volume73en_US
dc.citation.issue7en_US
dc.citation.spage1090en_US
dc.citation.epage1094en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000249104200007-
dc.citation.woscount5-
顯示於類別:期刊論文


文件中的檔案:

  1. 000249104200007.pdf

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