A construction of pooling designs with some happy surprises
The screening of data sets for "positive data objects" is essential to modern technology. A (group) test that indicates whether a positive data object is in a specific subset or pool of the dataset can greatly facilitate the identification of all the positive data objects. A collection of tested pools is called a pooling design. Pooling designs are standard experimental tools in many biotechnical applications. In this paper, we use the (linear) subspace relation coupled with the general concept of a "containment matrix" to construct pooling designs with surprisingly high degrees of error correction (detection.) Error-correcting pooling designs are important to biotechnical applications where error rates often are as high as 15%. What is also surprising is that the rank of the pooling design containment matrix is independent of the number of positive data objects in the dataset.
Medienart: |
Artikel |
---|
Erscheinungsjahr: |
2005 |
---|---|
Erschienen: |
2005 |
Enthalten in: |
Zur Gesamtaufnahme - volume:12 |
---|---|
Enthalten in: |
Journal of computational biology : a journal of computational molecular cell biology - 12(2005), 8 vom: 14. Okt., Seite 1129-36 |
Sprache: |
Englisch |
---|
Beteiligte Personen: |
D'Yachkov, A [VerfasserIn] |
---|
Themen: |
9007-49-2 |
---|
Anmerkungen: |
Date Completed 29.12.2005 Date Revised 15.11.2006 published: Print Citation Status MEDLINE |
---|
Förderinstitution / Projekttitel: |
|
---|
PPN (Katalog-ID): |
NLM158509951 |
---|
LEADER | 01000naa a22002652 4500 | ||
---|---|---|---|
001 | NLM158509951 | ||
003 | DE-627 | ||
005 | 20231223082337.0 | ||
007 | tu | ||
008 | 231223s2005 xx ||||| 00| ||eng c | ||
028 | 5 | 2 | |a pubmed24n0528.xml |
035 | |a (DE-627)NLM158509951 | ||
035 | |a (NLM)16241902 | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
100 | 1 | |a D'Yachkov, A |e verfasserin |4 aut | |
245 | 1 | 2 | |a A construction of pooling designs with some happy surprises |
264 | 1 | |c 2005 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
500 | |a Date Completed 29.12.2005 | ||
500 | |a Date Revised 15.11.2006 | ||
500 | |a published: Print | ||
500 | |a Citation Status MEDLINE | ||
520 | |a The screening of data sets for "positive data objects" is essential to modern technology. A (group) test that indicates whether a positive data object is in a specific subset or pool of the dataset can greatly facilitate the identification of all the positive data objects. A collection of tested pools is called a pooling design. Pooling designs are standard experimental tools in many biotechnical applications. In this paper, we use the (linear) subspace relation coupled with the general concept of a "containment matrix" to construct pooling designs with surprisingly high degrees of error correction (detection.) Error-correcting pooling designs are important to biotechnical applications where error rates often are as high as 15%. What is also surprising is that the rank of the pooling design containment matrix is independent of the number of positive data objects in the dataset | ||
650 | 4 | |a Journal Article | |
650 | 4 | |a Research Support, Non-U.S. Gov't | |
650 | 4 | |a Research Support, U.S. Gov't, Non-P.H.S. | |
650 | 7 | |a DNA Probes |2 NLM | |
650 | 7 | |a DNA |2 NLM | |
650 | 7 | |a 9007-49-2 |2 NLM | |
700 | 1 | |a Hwang, Frank |e verfasserin |4 aut | |
700 | 1 | |a Macula, Antony |e verfasserin |4 aut | |
700 | 1 | |a Vilenkin, Pavel |e verfasserin |4 aut | |
700 | 1 | |a Weng, Chih-Wen |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Journal of computational biology : a journal of computational molecular cell biology |d 1998 |g 12(2005), 8 vom: 14. Okt., Seite 1129-36 |w (DE-627)NLM074738046 |x 1557-8666 |7 nnns |
773 | 1 | 8 | |g volume:12 |g year:2005 |g number:8 |g day:14 |g month:10 |g pages:1129-36 |
912 | |a GBV_USEFLAG_A | ||
912 | |a GBV_NLM | ||
951 | |a AR | ||
952 | |d 12 |j 2005 |e 8 |b 14 |c 10 |h 1129-36 |