Screen LibraryCombinatorial group testing and its applications /
Group testing has been used in medical, chemical and electrical testing, coding, drug screening, pollution control, multiaccess channel management, and recently in data verification, clone library screening and AIDS testing. The mathematical model can be either combinatorial or probabilistic. This b...
Saved in:
| Main Authors: | |
|---|---|
| Corporate Authors: | |
| Group Author: | |
| Published: |
World Scientific Pub. Co.,
|
| Publisher Address: | Singapore : |
| Publication Dates: | 2000. |
| Literature type: | eBook |
| Language: | English |
| Edition: | Second edition. |
| Series: |
Series on applied mathematics ;
vol. 12 |
| Subjects: | |
| Online Access: |
http://www.worldscientific.com/worldscibooks/10.1142/4252#t=toc |
| Summary: |
Group testing has been used in medical, chemical and electrical testing, coding, drug screening, pollution control, multiaccess channel management, and recently in data verification, clone library screening and AIDS testing. The mathematical model can be either combinatorial or probabilistic. This book summarizes all important results under the combinatorial model, and demonstrates their applications in real problems. Some other search problems, including the famous counterfeit-coins problem, are also studied in depth. There are two reasons for publishing a second edition of this book. The f |
| Carrier Form: | 1 online resource (xii,323pages) : illustrations. |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: | 9789812798107 |
| Index Number: | QA182 |
| CLC: | O152 |
| Contents: | ch. 1. Introduction. 1.1. The history of group testing. 1.2. A prototype problem and some general remarks. 1.3. Some practical considerations -- ch. 2. General sequential algorithms. 2.1. The binary tree representation of a sequential algorithm. 2.2. The structure of group testing. 2.3. Li's s-stage algorithm. 2.4. Hwang's generalized binary splitting algorithm. 2.5. The nested class. 2.6. (d, n) algorithms and merging algorithms. 2.7. Number of group testing algorithms -- ch. 3. Sequential algorithms for special cases. 3.1. Two disjoint sets each containing exactly one defective. 3.2. An ap |