完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chen, H. B. | en_US |
dc.contributor.author | Hwang, F. K. | en_US |
dc.contributor.author | Li, C. M. | en_US |
dc.date.accessioned | 2014-12-08T15:16:33Z | - |
dc.date.available | 2014-12-08T15:16:33Z | - |
dc.date.issued | 2006-06-01 | en_US |
dc.identifier.issn | 1027-5487 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/12229 | - |
dc.description.abstract | d-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.iso | en_US | en_US |
dc.subject | pooling design | en_US |
dc.subject | nonadaptive group testing | en_US |
dc.subject | d-separable matrix | en_US |
dc.subject | (d)over-bar-separable matrix | en_US |
dc.title | Bounding the number of columns which appear only in positive pools | en_US |
dc.type | Article | en_US |
dc.identifier.journal | TAIWANESE JOURNAL OF MATHEMATICS | en_US |
dc.citation.volume | 10 | en_US |
dc.citation.issue | 4 | en_US |
dc.citation.spage | 927 | en_US |
dc.citation.epage | 932 | en_US |
dc.contributor.department | 應用數學系 | zh_TW |
dc.contributor.department | Department of Applied Mathematics | en_US |
dc.identifier.wosnumber | WOS:000238792300009 | - |
dc.citation.woscount | 1 | - |
顯示於類別: | 期刊論文 |