Back to Search
Start Over
A Variation of Cover-Free Families and Its Applications.
- Source :
-
Journal of Computational Biology . Jul2015, Vol. 22 Issue 7, p677-686. 10p. - Publication Year :
- 2015
-
Abstract
- A cover-free family is a family of subsets of a finite set in which no one is covered by the union of r others. We study a variation of cover-free family: A binary matrix is ( r, w] -consecutive-disjunct if for any w cyclically consecutive columns and another r cyclically consecutive columns , there exists one row intersecting but none of . In group testing, the goal is to determine a small subset of positive items D in a large population by group tests. By applying consecutive-disjunct matrices, we solve threshold group testing of consecutive positives in group tests nonadaptively, and the decoding complexity is where u is a threshold parameter in threshold group testing and it is assumed that | D|≤ d and . Meanwhile, we obtain that for group testing of consecutive positives, all positives can be identified in group tests nonadaptively and the decoding complexity is . [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10665277
- Volume :
- 22
- Issue :
- 7
- Database :
- Academic Search Index
- Journal :
- Journal of Computational Biology
- Publication Type :
- Academic Journal
- Accession number :
- 108303438
- Full Text :
- https://doi.org/10.1089/cmb.2014.0222