Selected article for: "binary splitting and positive case"

Author: Cassidy Mentus; Martin Romeo; Christian DiPaola
Title: Analysis and Applications of Non-Adaptive and Adaptive Group Testing Methods for COVID-19
  • Document date: 2020_4_7
  • ID: 3sr4djft_111
    Snippet: We test the performance of two algorithms: divide and test and generalized binary splitting. For populations of size 100 and 1000 with each case being positive independent of one another with probability p, we nd that both methods save many tests. In fact, even when we restrict the size of the groups they make substantial savings. For example at prevalence .001 and group sizes capped at 16, both DT16 and GBS16 are capable of outperforming Dorfman.....
    Document: We test the performance of two algorithms: divide and test and generalized binary splitting. For populations of size 100 and 1000 with each case being positive independent of one another with probability p, we nd that both methods save many tests. In fact, even when we restrict the size of the groups they make substantial savings. For example at prevalence .001 and group sizes capped at 16, both DT16 and GBS16 are capable of outperforming Dorfman's method, that requires a group size of 33 for optimal performance. For a population of 1000 and condence level .99, the DT16 and GBS16 also have a similar performance to Dorfman's method at .001 where Dorfman's method is chosen as if we knew the exact prevalence.

    Search related documents:
    Co phrase search for related documents
    • binary splitting and group size: 1, 2, 3, 4, 5
    • condence level and group size: 1, 2
    • group size and prevalence example: 1
    • group size and similar performance: 1
    • optimal performance and similar performance: 1, 2, 3