Search
 
Home| Join Our Mailing List| New Reviews| New Titles
Editor's Choice| Bestsellers| Textbooks| Book Series| Study Guides| E-Catalogues
  MATHEMATICS
  Applied Mathematics
General
Mathematical Finance/
Quantitative Finance

Mathematical Physics/
Theoretical Physics

Numerical & Computational
Mathematics

Probability & Statistics
Pure Mathematics
New Titles
August Bestsellers
Editor's Choice
Nobel Lectures
Textbooks
Recent Reviews
Book Series
Related Journals
  • Reviews in Mathematical Physics (RMP)
  • International Journal of Geometric Methods in Modern Physics (IJGMMP)
  • International Journal of Number Theory (IJNT)
  • Request for related catalogues
     
      PRODUCTS
      Journals
    eBooks
    Journals Archives
    eProceedings
     
      RESOURCES
      For Librarians
    For Authors
    For Booksellers
    For Translation Rights About Us
    Contact Us
    How to Order News
    Inspection Copy
     

    COMBINATORIAL GROUP TESTING AND ITS APPLICATIONS
    (2nd Edition)

    by Ding-Zhu Du (City University of Hong Kong, University of Minnesota, USA & Chinese Academy of Sciences, Beijing, China) & Frank K Hwang (National Chiao Tung University, Taiwan)

    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 first is the usual need to update the text (after six years) and correct errors. The second — and more important — reason is to accommodate the recent sudden growth of interest in applying the idea of group testing to clone library screening. This development is much more than just a new application, since the new application brings with it new objectives which require a new twist of theory. It also embraces the growing importance of two topics: nonadaptive algorithms and error tolerance. Two new chapters, one on clone library screening and the other on error tolerance, have been added. Also included is a new chapter on counterfeit coins, the most famous search problem historically, which recently drew on an unexpected connection to some deep mathematical theory to yield new results. Finally, the chapters have been reorganized into parts to provide focuses and perspectives.

     
    Contents:
    • Sequential Group Testing Algorithms:
      • General Sequential Algorithms
      • Sequential Algorithms for Special Cases
      • Competitive Group Testing
      • Unreliable Tests
      • Complexity Issues
    • Nonadaptive Group Testing Algorithms:
      • Deterministic Designs and Superimposed Codes
      • Random Designs and Error Tolerance
      • DNA Applications
    • Extended Group Testing Models:
      • Multiaccess Channels and Extensions
      • Additive Model and Others
      • Group Testing on Graphs
    • Other Related Searching Problems:
      • Optimal Search in One Variable
      • Unbounded Search
      • Membership Problems
      • Counterfeit Coins
     
    Readership: Applied mathematicians and operations researchers.
     


     
    336pp    Pub. date: Dec 1999  
    ISBN:   978-981-02-4107-0
    981-02-4107-0
       US$71 / £48

     


    336pp    Pub. date: Dec 1999  
    ISBN:   978-981-279-810-7(ebook)
    981-279-810-2(ebook)
       US$92 / £54

     


     

    Imperial College Press  |  Global Publishing  |  Asia-Pacific Biotech News  |  Innovation Magazine
    Labcreations Co  |  Meeting Matters  |  National Academies Press

    Copyright © 2009 World Scientific Publishing Co. All rights reserved.
    Updated on 20 November 2009