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 条
  • [1] Non-adaptive Group Testing on Graphs
    Kameli, Hamid
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2018, 20 (01):
  • [2] Non-Adaptive Group Testing with Inhibitors
    Ganesan, Abhinav
    Jaggi, Sidharth
    Saligrama, Venkatesh
    2015 IEEE INFORMATION THEORY WORKSHOP (ITW), 2015,
  • [3] Non-adaptive group testing on graphs with connectivity
    Luo, Song
    Matsuura, Yuji
    Miao, Ying
    Shigeno, Maiko
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (01) : 278 - 291
  • [4] Non-adaptive group testing on graphs with connectivity
    Song Luo
    Yuji Matsuura
    Ying Miao
    Maiko Shigeno
    Journal of Combinatorial Optimization, 2019, 38 : 278 - 291
  • [5] Non-adaptive group testing in the presence of errors
    Knill, E
    Bruno, WJ
    Torney, DC
    DISCRETE APPLIED MATHEMATICS, 1998, 88 (1-3) : 261 - 290
  • [6] Subquadratic non-adaptive threshold group testing
    De Marco, Gianluca
    Jurdzinski, Tomasz
    Kowalski, Dariusz R.
    Rozanski, Michal
    Stachowiak, Grzegorz
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 111 : 42 - 56
  • [7] Subquadratic Non-adaptive Threshold Group Testing
    De Marco, Gianluca
    Jurdzinski, Tomasz
    Rozanski, Michal
    Stachowiak, Grzegorz
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2017, 2017, 10472 : 177 - 189
  • [8] Construction of d(H)-disjunct matrix for group testing in hypergraphs
    Gao, Hong
    Hwang, F. K.
    Thai, My T.
    Wu, Weili
    Znati, Taieb
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2006, 12 (03) : 297 - 301
  • [9] Construction of d(H)-disjunct matrix for group testing in hypergraphs
    Hong Gao
    F. K. Hwang
    My T. Thai
    Weili Wu
    Taieb Znati
    Journal of Combinatorial Optimization, 2006, 12 : 297 - 301
  • [10] Improved Constructions for Non-adaptive Threshold Group Testing
    Cheraghchi, Mahdi
    ALGORITHMICA, 2013, 67 (03) : 384 - 417