## On the Cut-off Point for Combinatorial Group Testing

Publication: Research - peer-review › Journal article – Annual report year: 1999

### Standard

**On the Cut-off Point for Combinatorial Group Testing.** / Fischer, Paul; Klasner, N.; Wegener, I.

Publication: Research - peer-review › Journal article – Annual report year: 1999

### Harvard

*Discrete Applied Mathematics*, vol 91, no. 1-3, pp. 83-92.

### APA

*Discrete Applied Mathematics*,

*91*(1-3), 83-92.

### CBE

### MLA

*Discrete Applied Mathematics*. 1999, 91(1-3). 83-92.

### Vancouver

### Author

### Bibtex

}

### RIS

TY - JOUR

T1 - On the Cut-off Point for Combinatorial Group Testing

AU - Fischer,Paul

AU - Klasner,N.

AU - Wegener,I.

PB - Elsevier BV North-Holland

PY - 1999

Y1 - 1999

N2 - The following problem is known as group testing problem for n objects. Each object can be essential (defective) or non-essential (intact). The problem is to determine the set of essential objects by asking queries adaptively. A query can be identified with a set Q of objects and the query Q is answered by 1 if Q contains at least one essential object and by 0 otherwise. In the statistical setting the objects are essential, independently of each other, with a given probability p <1 while in the combinatorial setting the number k <n of essential objects is known. The cut-off point of statistical group testing is equal to p* = 12(3 - 5), i.e., the strategy of testing each object individually minimizes the average number of queries iff p >= p* or n = 1. In the combinatorial setting the worst case number of queries is of interest. It has been conjectured that the cut-off point of combinatorial group testing is equal to alpha* = 13, i.e., the strategy of testing n - 1 objects individually minimizes the worst case number of queries iff k/n >= alpha* and k <n. Some results in favor of this conjecture are proved.

AB - The following problem is known as group testing problem for n objects. Each object can be essential (defective) or non-essential (intact). The problem is to determine the set of essential objects by asking queries adaptively. A query can be identified with a set Q of objects and the query Q is answered by 1 if Q contains at least one essential object and by 0 otherwise. In the statistical setting the objects are essential, independently of each other, with a given probability p <1 while in the combinatorial setting the number k <n of essential objects is known. The cut-off point of statistical group testing is equal to p* = 12(3 - 5), i.e., the strategy of testing each object individually minimizes the average number of queries iff p >= p* or n = 1. In the combinatorial setting the worst case number of queries is of interest. It has been conjectured that the cut-off point of combinatorial group testing is equal to alpha* = 13, i.e., the strategy of testing n - 1 objects individually minimizes the worst case number of queries iff k/n >= alpha* and k <n. Some results in favor of this conjecture are proved.

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1-3

VL - 91

SP - 83

EP - 92

ER -