The Construction of Disjunct Matrix for Non-Adaptive Group Testing

被引:0
|
作者
Zahidah, S. [1 ]
Barra, A. [2 ]
机构
[1] Univ Airlangga, Dept Math, Surabaya 60115, Indonesia
[2] Inst Teknol Bandung, Dept Math, Bandung 40132, Indonesia
关键词
D O I
10.1088/1742-6596/1028/1/012116
中图分类号
G40 [教育学];
学科分类号
040101 ; 120403 ;
摘要
Historically, group testing theory related to the testing of blood samples to identify a disease. Based on the algorithm, there are two types of group testing, Adaptive Group Testing (AGT) and Non-Adaptive Group Testing (NAGT). NAGT algorithm can be represented by a binary matrix M = m(ij), where columns are labeled by items and rows by tests (blocks). Criteria of matrix is m(ij) = 1 if test i contains item j and the other m(ij) = 0. On the other hand, the test results of each block are represented by a column vector, called outcome vector. Based on these representations, the problem of group testing can be viewed as finding representation matrix M which satisfies the equation Mx = y, where y is an outcome vector and x are tested samples. If there are d positive samples of n samples then we say d-Combinatorial Group Testing, abbreviated by d-CGT. This paper presents two constructions of disjunct matrix. The first construction based on generating of binary matrices and the second construction using modular equation. Furthermore, from the construction will be modified such that the new construction can be identified more than d positive samples.
引用
收藏
页数:7
相关论文
共 50 条
  • [41] Aggregate Message Authentication Code Capable of Non-Adaptive Group-Testing
    Hirose, Shoichi
    Shikata, Junji
    IEEE ACCESS, 2020, 8 : 216116 - 216126
  • [42] Non-adaptive Quantitative Group Testing Using Irregular Sparse Graph Codes
    Karimi, Esmaeil
    Kazemi, Fatemeh
    Heidarzadeh, Anoosheh
    Narayanan, Krishna R.
    Sprintson, Alex
    2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2019, : 608 - 614
  • [43] Efficiently Decodable Non-adaptive Croup Testing
    Indyk, Piotr
    Ngo, Hung Q.
    Rudra, Atri
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 1126 - +
  • [44] Belief Propagation With Optimized Pool Size for Non-Adaptive Group Testing: An Empirical Study
    Wang, Shuai
    Huang, Qin
    IEEE ACCESS, 2022, 10 : 107170 - 107176
  • [45] Settling the Query Complexity of Non-adaptive Junta Testing
    Chen, Xi
    Servedio, Rocco A.
    Tan, Li-YANG
    Waingarten, Erik
    Xie, Jinyu
    JOURNAL OF THE ACM, 2018, 65 (06)
  • [46] Settling the Query Complexity of Non-Adaptive Junta Testing
    Chen, Xi
    Servedio, Rocco A.
    Tan, Li-Yang
    Waingarten, Erik
    Xie, Jinyu
    32ND COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2017), 2017, 79
  • [47] Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model
    Goldreich, Oded
    Wigderson, Avi
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 269 - 275
  • [48] The factors that favor adaptive habitat construction versus non-adaptive environmental conditioning
    Scheiner, Samuel M.
    Barfield, Michael
    Holt, Robert D.
    ECOLOGY AND EVOLUTION, 2022, 12 (03):
  • [49] Non-adaptive fault diagnosis for all-optical networks via combinatorial group testing on graphs
    Harvey, Nicholas J. A.
    Patrascu, Mihai
    Wen, Yonggang
    Yekhanin, Sergey
    Chan, Vincent W. S.
    INFOCOM 2007, VOLS 1-5, 2007, : 697 - +
  • [50] NON-ADAPTIVE CHARACTERS
    FORD, EB
    NATURE, 1949, 164 (4177) : 882 - 882