Hostname: page-component-848d4c4894-x5gtn Total loading time: 0 Render date: 2024-06-11T19:00:57.038Z Has data issue: false hasContentIssue false
  • English
  • Français

A NEW CONSTRUCTION FOR POOLING DESIGNS

Part of: Graph theory

Published online by Cambridge University Press:  26 September 2011

FENGLIANG JIN ,
HOUCHUN ZHOU  and
JUAN XU
FENGLIANG JIN*
Affiliation:
Sch. Sci., Linyi University, Linyi, 276005, PR China Sch. Math. Sci., Shandong Normal University, Jinan, 250014, PR China (email: jflajj@163.com)
HOUCHUN ZHOU
Affiliation:
Sch. Sci., Linyi University, Linyi, 276005, PR China
JUAN XU
Affiliation:
Sch. Sci., Linyi University, Linyi, 276005, PR China
*
✉For correspondence; e-mail: jflajj@163.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Pooling designs are a very helpful tool for reducing the number of tests for DNA library screening. A disjunct matrix is usually used to represent the pooling design. In this paper, we construct a new family of disjunct matrices and prove that it has a good row to column ratio and error-tolerant property.

Keywords

disjunct matrixpooling designrow to column ratioerror-tolerant property

MSC classification

Secondary: 05C10: Planar graphs; geometric and topological aspects of graph theory
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 85 , Issue 1 , February 2012 , pp. 121 - 127
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2011

Footnotes

This work is partially supported by grants from the National Natural Science Foundation of China (NSFC No. 10771120) and the Shandong Natural Science Foundation of China (No. Y2008A27).

References

[1]Bai, Y. J., Huang, T. Y. and Wang, K. S., ‘Error-correcting pooling designs associated with some distance-regular graphs’, Discrete Appl. Math. 157 (2009), 3038–3045.CrossRefGoogle Scholar
[2]D’yachkov, A. G., Hwang, F. K. and Macula, A. J., ‘A construction of pooling designs with some happy surprises’, J. Comput. Biol. 12 (2005), 1127–1134.Google ScholarPubMed
[3]D’yachkov, A. G., Macula, A. J. and Vilenkin, P. A., ‘Nonadaptive and trivial two-stage group testing with error-correcting d-disjunct inclusion matrices’, in: Entropy, Search, Complexity, Bolyai Society Mathematical Studies, 16 (Springer, Berlin, 2007), pp. 71–83.CrossRefGoogle Scholar
[4]Huang, T. Y. and Weng, C. W., ‘A note on decoding of superimposed codes’, J. Comb. Optim. 7 (2003), 381–384.CrossRefGoogle Scholar
[5]Huang, T. Y. and Weng, C. W., ‘Pooling spaces and non-adaptive pooling designs’, Discrete Math. 282 (2004), 163–169.CrossRefGoogle Scholar
[6]Kautz, W. H. and Singleton, R. C., ‘Nonrandom binary superimposed codes’, IEEE Trans. Inform. Theory 10 (1964), 363–377.CrossRefGoogle Scholar
[7]Macula, A. J., ‘A simple construction of d-disjunct matrices with certain constant weights’, Discrete Math. 162 (1996), 311–312.CrossRefGoogle Scholar
[8]Macula, A. J., ‘Error-correcting nonadaptive group testing with d e-disjunct matrices’, Discrete Appl. Math. 80 (1997), 217–222.CrossRefGoogle Scholar
[9]Ngo, H. Q. and Du, D. Z., ‘New constructions of non-adaptive and error-tolerance pooling designs’, Discrete Math. 243 (2002), 161–170.CrossRefGoogle Scholar
[10]Zhao, P., Diao, K. F. and Wang, K. S., ‘A generalization of Macula’s disjunct matrices’, J. Comb. Optim. (2010).Google Scholar