Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.09455 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916247889772544 |
|---|---|
| author | Matsushima, Hiroyasu Tajima, Yusuke Lu, Xiao-Nan Jimbo, Masakazu |
| author_facet | Matsushima, Hiroyasu Tajima, Yusuke Lu, Xiao-Nan Jimbo, Masakazu |
| contents | Group testing is utilized in the case when we want to find a few defectives among large amount of items. Testing n items one by one requires n tests, but if the ratio of defectives is small, group testing is an efficient way to reduce the number of tests. Many research have been developed for group testing for a single type of defectives. In this paper, we consider the case where two types of defective A and B exist. For two types of defectives, we develop a belief propagation algorithm to compute marginal posterior probability of defectives. Furthermore, we construct several kinds of collections of pools in order to test for A and B. And by utilizing our belief propagation algorithm, we evaluate the performance of group testing by conducting simulations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_09455 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Efficient pooling designs and screening performance in group testing for two type defectives Matsushima, Hiroyasu Tajima, Yusuke Lu, Xiao-Nan Jimbo, Masakazu Computation Information Theory Group testing is utilized in the case when we want to find a few defectives among large amount of items. Testing n items one by one requires n tests, but if the ratio of defectives is small, group testing is an efficient way to reduce the number of tests. Many research have been developed for group testing for a single type of defectives. In this paper, we consider the case where two types of defective A and B exist. For two types of defectives, we develop a belief propagation algorithm to compute marginal posterior probability of defectives. Furthermore, we construct several kinds of collections of pools in order to test for A and B. And by utilizing our belief propagation algorithm, we evaluate the performance of group testing by conducting simulations. |
| title | Efficient pooling designs and screening performance in group testing for two type defectives |
| topic | Computation Information Theory |
| url | https://arxiv.org/abs/2405.09455 |