Sets pooling designs (Q1306748)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1347993
Language Label Description Also known as
default for all languages
No label defined
    English
    Sets pooling designs
    scientific article; zbMATH DE number 1347993

      Statements

      Sets pooling designs (English)
      0 references
      0 references
      13 March 2000
      0 references
      A pooling design is a collection of subsets, called pools, of a finite set \(U\). Conventional pooling designs are used to identify distinguished (positive) elements of \(U\). Provided there are no experimental errors, a pool containing at least one positive object yields a positive assay. The author introduces the notion of positive subset, so that a pool yields a positive assay when it contains a positive subset. Sets pooling designs generalise conventional pooling designs and their introduction is motivated by modern molecular and cellular biology. The feasibility of constructing sets pooling designs is discussed by investigating random, non-adaptive designs in the case all distinguished subsets have the same size. Deterministic and adaptive designs are described, too. An interesting formula is proved for an optimum probability for including an object in a pool.
      0 references
      block design
      0 references
      group testing
      0 references
      extremal sets
      0 references
      asymptotic approximation
      0 references
      pooling design
      0 references
      positive subset
      0 references
      sets pooling designs
      0 references
      adaptive designs
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references