Result: Improved combinatorial group testing for real-world problem sizes
Title:
Improved combinatorial group testing for real-world problem sizes
Source:
Algorithms and data structurese (Waterloo ON, 15-17 August 2005)Lecture notes in computer science. :86-98
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 13 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Borne inférieure, Lower bound, Cota inferior, Défaut, Defect, Defecto, Méthode adaptative, Adaptive method, Método adaptativo, Méthode combinatoire, Combinatorial method, Método combinatorio, Structure donnée, Data structure, Estructura datos, Théorie information, Information theory, Teoría información
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dept. of Computer Science, Univ. of California, Irvine, CA 92697-3425, United States
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17116046
Database:
PASCAL Archive
Further Information
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which identify the at most d items out of a given set of n items that are defective, using fewer tests for all practical set sizes. For example, our two-stage algorithm matches the information theoretic lower bound for the number of tests in a combinatorial group testing regimen.