scholarly journals Performance of Group Testing Algorithms With Near-Constant Tests Per Item

2019 ◽  
Vol 65 (2) ◽  
pp. 707-723 ◽  
Author(s):  
Oliver Johnson ◽  
Matthew Aldridge ◽  
Jonathan Scarlett
Biometrics ◽  
2015 ◽  
Vol 72 (1) ◽  
pp. 299-302 ◽  
Author(s):  
Yaakov Malinovsky ◽  
Paul S. Albert ◽  
Anindya Roy

Biometrics ◽  
2007 ◽  
Vol 63 (4) ◽  
pp. 1152-1163 ◽  
Author(s):  
Hae-Young Kim ◽  
Michael G. Hudgens ◽  
Jonathan M. Dreyfuss ◽  
Daniel J. Westreich ◽  
Christopher D. Pilcher

2020 ◽  
Vol 68 (4) ◽  
pp. 743-759
Author(s):  
Dimitrije Čvokić

Introduction/purpose: The purpose of group testing algorithms is to provide a more rational resource usage. Therefore, it is expected to improve the efficiency of large-scale COVID-19 screening as well. Methods: Two variants of non-adaptive group testing approaches are presented: Hwang's generalized binary-splitting algorithm and the matrix strategy. Results: The positive and negative sides of both approaches are discussed. Also, the estimations of the maximum number of tests are given. The matrix strategy is presented with a particular modification which reduces the corresponding estimation of the maximum number of tests and which does not affect the complexity of the procedure. This modification can be interesting from the applicability viewpoint. Conclusion: Taking into account the current situation, it makes sense to consider these methods in order to achieve some resource cuts in testing, thus making the epidemiological measures more efficient than they are now.


Sign in / Sign up

Export Citation Format

Share Document