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 条
  • [31] Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing
    Bshouty, Nader H.
    Haddad, George
    Haddad-Zaknoon, Catherine A.
    SOFSEM 2020: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2020, 12011 : 101 - 112
  • [32] Using non-adaptive group testing to construct spy agent routes
    Kalogridis, Georgios
    Mitchell, Chris J.
    ARES 2008: PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON AVAILABILITY, SECURITY AND RELIABILITY, 2008, : 1013 - +
  • [33] Optimal non-adaptive probabilistic group testing in general sparsity regimes
    Bay, Wei Heng
    Scarlett, Jonathan
    Price, Eric
    INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, 2022, 11 (03) : 1037 - 1053
  • [34] Early detection for networking anomalies using Non-Adaptive Group Testing
    Bui, Thach V.
    Huynh, Chinh N.
    Nguyen, Thuc D.
    2013 INTERNATIONAL CONFERENCE ON ICT CONVERGENCE (ICTC 2013): FUTURE CREATIVE CONVERGENCE TECHNOLOGIES FOR NEW ICT ECOSYSTEMS, 2013, : 984 - 987
  • [35] An Analysis on Non-Adaptive Group Testing based on Sparse Pooling Graphs
    Wadayama, Tadashi
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2681 - 2685
  • [36] NON-ADAPTIVE VARIATION AND GROUP SELECTION
    CLOUDSLE.JL
    SCIENCE PROGRESS, 1971, 59 (234) : 243 - +
  • [37] List-Decoding Separable Matrices for Non-Adaptive Combinatorial Group Testing
    Fan, Jinping
    Gu, Yujie
    Miao, Ying
    Yu, Zhebin
    2024 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, ISIT 2024, 2024, : 3237 - 3242
  • [38] Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
    De Bonis, Annalisa
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (04) : 1254 - 1287
  • [39] Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach
    Scarlett, Jonathan
    Johnson, Oliver
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (06) : 3775 - 3797
  • [40] Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
    Annalisa De Bonis
    Journal of Combinatorial Optimization, 2016, 32 : 1254 - 1287