My Account Log in

3 options

Pooling designs and nonadaptive group testing : important tools for DNA sequencing / Ding-Zhu Du, Frank K. Hwang.

EBSCOhost Academic eBook Collection (North America) Available online

View online

EBSCOhost eBook Community College Collection Available online

View online

Ebook Central Academic Complete Available online

View online
Format:
Book
Author/Creator:
Du, Dingzhu.
Contributor:
Hwang, Frank.
Series:
Series on applied mathematics ; v. 18.
Series on applied mathematics ; v. 18
Language:
English
Subjects (All):
Molecular biology--Mathematics.
Molecular biology.
Nucleotide sequence--Mathematics.
Nucleotide sequence.
Combinatorial group theory.
Physical Description:
1 online resource (248 p.)
Edition:
1st ed.
Place of Publication:
New Jersey : World Scientific, c2006.
Language Note:
English
Summary:
Pooling designs have been widely used in various aspects of DNA sequencing. In biological applications, the well-studied mathematical problem called "group testing" shifts its focus to nonadaptive algorithms while the focus of traditional group testing is on sequential algorithms. Biological applications also bring forth new models not previously considered, such as the error-tolerant model, the complex model, and the inhibitor model. This book is the first attempt to collect all the significant research on pooling designs in one convenient place. The coverage includes many real biological a
Contents:
Contents ; Preface ; Chapter 1 Introduction ; 1.1 Group Testing ; 1.2 Nonadaptive Group Testing ; 1.3 Applications in Molecular Biology ; 1.4 Pooling Designs for Two Simple Applications ; 1.5 Pooling Designs and Mathematics ; 1.6 An Outline of the Book ; References
Chapter 2 Basic Theory on Separating Matrices 2.1 d-Separable and d-Separable Matrices ; 2.2 d-Disjunct Matrices ; 2.3 The Minimum Number of Pools for Given d and n ; 2.4 Combinatorial Bounds for d-Disjunct Matrices with Constant Weight ; 2.5 Asymptotic Lower and Upper Bounds
2.6 (d r)-Disjunct Matrices 2.7 Error-Tolerance ; References ; Chapter 3 Deterministic Designs ; 3.1 t-Designs and t-Packing ; 3.2 Direct Construction ; 3.3 Explicit Construction of Selectors ; 3.4 Grid Designs ; 3.5 Error-Correcting Code ; 3.6 Transversal Designs
3.7 The d = 2 Case References ; Chapter 4 Deterministic Designs from Partial Orders ; 4.1 Subset Containment Designs ; 4.2 Partial Order of Faces in a Simplicial Complex ; 4.3 Monotone Graph Properties ; 4.4 Partial Order of Linear Spaces over a Finite Field ; 4.5 Atomic Poset
References Chapter 5 Random Pooling Designs and Probabilistic Analysis ; 5.1 Introduction to Random Designs ; 5.2 A General Approach to Compute Probabilities of Unresolved Clones ; 5.3 Random Incidence Designs ; 5.4 Random k-Set Designs ; 5.5 Random r-Size Designs
5.6 Random Distinct k-Set Designs
Notes:
Description based upon print version of record.
Includes bibliographical references and index.
ISBN:
9786611924782
9781281924780
1281924784
9789812773463
9812773460
OCLC:
879023629

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account