Threshold group testing with consecutive positives
碩士 === 國立高雄大學 === 應用數學系碩士班 === 102 === Threshold group testing introduced by Damaschke (2006) is a generalization of classical group testing where a group test yields a positive (negative) outcome if it contains at least u (at most l) positive items, and an arbitrary outcome for otherwise. Motivated...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/66300153934466049026 |
| Summary: | 碩士 === 國立高雄大學 === 應用數學系碩士班 === 102 === Threshold group testing introduced by Damaschke (2006) is a generalization of classical group testing where a group test yields a positive (negative) outcome if it contains at least u (at most l) positive items, and an arbitrary outcome for otherwise.
Motivated by applications to DNA sequencing, group testing with consecutive positives has been proposed by Balding and Torney (1997) and Colbourn (1999) where n items are linearly ordered and all up to d positive items are consecutive in the order. In this thesis, we use threshold-constrained group tests to deal with group testing with consecutive positives. We prove that all positive items can be identifed in ⌈log2(⌈
|
|---|