完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChen, H. B.en_US
dc.contributor.authorHwang, F. K.en_US
dc.contributor.authorLi, C. M.en_US
dc.date.accessioned2014-12-08T15:16:33Z-
dc.date.available2014-12-08T15:16:33Z-
dc.date.issued2006-06-01en_US
dc.identifier.issn1027-5487en_US
dc.identifier.urihttp://hdl.handle.net/11536/12229-
dc.description.abstractd-separable, (d) over bar -separable and d-disjunct matrices are the major tools in constructing pooling designs which has many applications to DNA experiments, for example, the clone library screening problem. While there exists a simple decoding for d-disjunct matrices, only brute-force methods are known for the other two. In this paper we identify structures in these two matrices which lead to significant improvements for decoding.en_US
dc.language.isoen_USen_US
dc.subjectpooling designen_US
dc.subjectnonadaptive group testingen_US
dc.subjectd-separable matrixen_US
dc.subject(d)over-bar-separable matrixen_US
dc.titleBounding the number of columns which appear only in positive poolsen_US
dc.typeArticleen_US
dc.identifier.journalTAIWANESE JOURNAL OF MATHEMATICSen_US
dc.citation.volume10en_US
dc.citation.issue4en_US
dc.citation.spage927en_US
dc.citation.epage932en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000238792300009-
dc.citation.woscount1-
顯示於類別:期刊論文