Pooling designs and nonadaptive group testing: Important tools for dna sequencing

Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing

Volumn , Issue , 2006, Pages 1-237

  Du, Ding Zhu ^a,b   Hwang, Frank K ^c  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b XI'AN JIAOTONG UNIVERSITY   (China)

^c NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85115681798     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/6122     Document Type: Book

References (185)

1. N. Alon, R. Beigel, S. Kasif, S. Rudth and B. Sudarov, Learning a hidden matching.
2. M. Aigner, Search problems in graphs, Disc. Appl. Math., 14 (1986) 215-230.
3. M. C. Cai, On the problem of Katona on minimal completely separating systems with restrictions, Disc. Math., 48 (1984) 121-123.
4. C. Colbourn, Group testing for consecutive positives, Ann. Combinatorics, 3 (1999) 37-41.
5. G. J. Chang and F. K. Hwang, A group testing problem, SIAM J. Alg. Disc. Meth., 1 (1980) 21-24.
6. T. Chen and F. K. Hwang, A competitive algorithm in searching for many edges in a hypergraph, 2003, preprint.
7. P. Damaschke, A tight upper bound for group testing in graphs, Disc. Math., 48 (1994) 101-109.
8. D.-Z. Du and F.K. Hwang, Combinatorial Group Testing and Its Applications (2nd edition), World Scientific, 1999.
9. V. Grebinski and G. Kucherov, Optimal reconstruction of graphs under additive model, Algorithmica, 28 (2000) 104-124.
10. F. K. Hwang and W. D. Lin, The incremental group testing model for gap closing in sequencing long molecules, J. Combin. Opt., 7 (2003) 327-337.
11. F. K. Hwang, T. T. Song and D.-Z. Du, Hypergeometric and generalized hypergeometric group testing, SIAM J. Alg. Disc. Methods, 2 (1981) 426-428.
12. P. Johann, A group testing problem for graphs with several defective edges, Disc. Appl. Math., 117 (2002) 99-108.
13. A. Knudgen, D. Mubayi and P. Tetali, Minimal completely separating systems of fc-sets, J. Combin. Thy, Series A, 93 (2001) 192-198.
14. J. H. van Lint and R. M. Wilson, A Course in Combinatorics, Cambridge University Press, Cambridge, 1992.
15. M. Muller and M. Jimbo, Consecutive positive delectable matrices and group testing for consecutive positives, Disc. Math., 279 (2001) 369-381.
16. C. Ramsey and I. T. Roberts, Minimal completely separating systems of sets, Austral. J. Combin., 13 (1996) 129-151.
17. D. J. Schultz, M. Parnes and R. Srinivasan, Further applications of d-complete designs to group testing, J. Combin. Inform. & Syst. Sci., 8 (1993) 31-41.
18. A. Schliep, D. C. Torney, S. Rahmann, Group testing with DNA chips: generating designs and decoding experiments, Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003.
19. J. Spencer, Minimal completely separating systems, J. Combin. Thy., 8 (1970) 446-447.
20. N. Thierry-Mieg, L. Trilling and J.-L. Roch, A novel pooling design for proteinprotein interaction mapping, manuscript, 2004.
21. E. Triesch, A group testing problem for hypergraphs of bounded rank, Disc. Appl. Math., 66 (1996) 185-188.
22. G. Xu, S.-H. Sze, C.-P. Liu, P.A. Pevzner and N. Arnheim, Gene hunting without sequencing genomic clones: finding exon bounderies in cDNA, Genomics, 47 (1998) 171-179.
23. D. J. Balding and D. C. Torney, Optimal pool designs with error detection, J. Combin. Thy., Series A, 74 (1996) 131-140.
24. H. B. Chen and F. K. Hwang, Exploring the missing link among d-separable, ¿-separable, and d-disjunct matrices, preprint, 2003.
25. H. B. Chen, F. K. Hwang and C. M. Li, Bounding the number of columns which appear only in positive pools, Taiwan. J. Math., to appear.
26. A. De Bonis, L. Gasieniec and U. Vaccaro, Optimal two-stage algorithms for group testing problems, SIAM J. Comput., 34 (2005) 1253-1270.
27. D.-Z. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications (2nd Ed.), (World Scientific, 2000), pp. 167-168.
28. A. G. Dyachkov and V. V. Rykov, Bounds of the length of disjunct codes, Problems Control Inform. Thy., 11 (1982), 7-13.
29. A. G. Dyachkov and V. V. Rykov, A survey of superimposed code theory, Problems. Control Inform. Thy., 12 (1983) 1-13.
30. A. G. D’yachkov, V. V. Rykov and A. M. Rachad, Superimposed distance codes, Problems Contrd Inform. Thy., 12 (1983) 1-13.
31. P. Erdos, P. Frankl and Z. Fiiredi, Families of finite sets in which no set is covered by the union of two others, J. Combin. Thy. A33 (1982) 158-166.
32. P. Erdos, P. Frankl and D. Fiiredi, Families of finite sets in which no set is covered by the union of r others, Israel J. Math., 51 (1985) 79-89.
33. P. Frankl, On Sperner families satisfying an additional condition, J. Combin. Thy. A24 (1976) 1-11.
34. Z. Fiiredi, On r-cover-free families, J. Combin. Thy., A73 (1996) 172-173.
35. J. H. Huang and F. K. Hwang, when is individual testing optimal for nonadaptive group testing? SIAM J. Math., 14 (2001) 540-548.
36. F. K. Hwang, On Macula’s error-correcting pooling design, to appear in Discrete Mathematics, 268 (2003) 311-314.
37. F. K. Hwang and V. T. Sos, Non-adaptive hypergeometric group testing, Studia Scient. Math. Hungarica, 22 (1987) 257-263.
38. S. M. Johnson, A new upper bound for error correcting codes, IEEE Trans. Inform. Thy., 8 (1962) 203-207.
39. W. H. Kautz and R. R. Singleton, Nonrandom binary superimposed codes, IEEE Trans. Inform. Thy., 10 (1964) 363-377.
40. M. Li, Private communication.
41. L. Lovasz, On the ratio of optimal integral and fractional covers, Disc. Math., 13 (1975) 383-390.
42. e-disjunct matrices, Disc. Appl. Math., 80 (1997) 217-222.
43. Q. A. Nguyen and T. Zeisel, Bounds on constant weight binary superimposed codes, Probl. Control & Inform. Thy., 17 (1988) 223-230.
44. V. Rodl, On a packing and covering problem, Euro. J. Combin., 5 (1984).
45. M. Ruszinko, On the upper bound of the size of the r-cover-free families, J. Combin. Thy., Series A, 66 (1994) 302-310.
46. G. M. Saha and B. K. Sinha, Some combinatorial aspects of designs useful in group testing experiments, unpublished manuscript.
47. E. Sperner, En Satz iiber Untermengen einer endlichen menge, Math. Z., 27 (1928) 544-548.
48. R. Wei, On cover-free families, preprint, 2004.
49. W. Wu, C. Li, X. Wu and X. Huang, Decoding in pooling designs, Journal of Combinatorial Optimization, 7 (2003).
50. W. Wu, Y. Huang, X. Huang and Y. Li, On error-tolerant DNA screening, Discrete Applied Mathematics, to appear.
51. D. J. Balding and D.C. Torney, Optimal pool designs with error detection, J. Combin. Thy., Series A, 74 (1996) 131-140.
52. E. Barillot, B. Lacroix and D. Cohen, Theoretical analysis of library screening using a n-dimensional pooling strategy, Nucl. Acids Res., (1991), no. 19, 6241-6247.
53. B. S. Chlebus and D. R. Kowalski, Almost optimal explicit selector, Lecture Notes in Computer Science 3623 (Springer-Verlag, 2005) 270-280.
54. C. Colbourn, D. Hoffman and R. Reed, A new class of group divisible designs with block size three, J. Combin. Thy., 59 (1992) 73-89.
55. D.-Z. Du, F. K. Hwang, W. Wu and T. Znati, A new construction of transversal designs, Journal of Computational Biology, to appear.
56. D.-Z. Du, F. K. Hwang, W. Wu and T. Znati, An improvement on construction of transversal designs, manuscript.
57. A. J. Hoffman and R. R. Singleton, On Moore graphs with diameters 2 and 3, IBM J. Res. Develop., 4 (1960) 497-504.
58. W.T. Huang and F. K. Hwang, Private communication.
59. F. K. Hwang, An isomorphic factorization of the complete graph, Journal of Graph Theory, 19 (1995) no. 3, 333-337.
60. F. K. Hwang and V. T Sos, Non-adaptive hypergeometric group testing, Studia Scient. Math. Hungarica, 22 (1987) 257-263.
61. P. Indyk, Explicit constructions of selecors and related combinatorial structures with applications, Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 697-704.
62. W. H. Kautz and R.C. Singleton, Nonrandom binary superimposed codes, IEEE Trans. Inform. Thy., 10 (1964) 363-377.
63. B. Lindstrom, Determination of two vectors from the sum, J. Combin. Thy., A6 (1969) 402-407.
64. D. Lubell, A short proof of Sperner’s lemmas, J. Combin. Theory, 1 (1966) 299.
65. Q. A. Nguyen and T. Zeisel, Bounds on constant weight binary superimposed codes, Probl. Control & Inform. Thy., 17 (1988) 223-230.
66. D. Raghavarao, Constructions and Combinatorial Problems in Designs of Experiments, (Wiley, New York, 1971).
67. V. Rodl, On a packing and covering problem, Euro., J. Combi., 5 (1984).
68. S. Roman, Coding and Information Theory, (Springer-Verlag, New York, 1992).
69. G. M. Saha, H. Pesotan and B. L. Raktoc, Some results on /-complete designs, Ars Combin., 13 (1982) 195-201.
70. J. Schonheim, On maximal systems of A;-tuples, Studia Sci. Math. Hungar, 1 (1966) 363-368.
71. D. J. Schultz, M. Parnes and R. Srinivasan, Further applications of d-complete designs to group testing, J. Combin. Inform. & System Sci., 8 (1993) 31-41.
72. R. R. Singleton, Maximum distance g-nary codes, IEEE Trans. Inform. Thy., 10 (1964) 116-118.
73. A. Ta-Shma, C. Uman and D. Zuckerman, Loss-less condensers, unbalanced expanders, and extractors, Proceedings of 33rd ACM Symposium on Theory of Computing (STOC), 2001, pp. 143-152.
74. F. Vakil and M. Parnes, On the structure of a class of sets useful in non-adaptive group-testing, J. Statist. Plan. & Infer., 39 (1994) 57-69.
75. F. Vakil, M. Parnes and D. Raghavarao, Group testing with at most two defectives when every item is included in exactly two group tests, Utilitas Math., 38 (1990) 161-164.
76. C. A. Weideman and D. Raghavarao, Some optimum non-adaptive hypergeometric group testing designs for identifying defectives, J. Statist. Plan. Infer., 16 (1987) 55-61.
77. C. A. Weideman and D. Raghavarao, Nonadaptive hypergeometric group testing designs for identifying at most two defectives, Commun. Statist., 16A (1987), 2991-3006.
78. V. Zinoviev, Cascade equal-weight codes and maximal packing, Probl. Control & Inform. Thy., 12 (1983) 3-10.
79. A. G. D’yachkov, F. K. Hwang, A. J. Macula, P. A. Vilenkin and C.-W. Weng, A construction of pooling designs with some happy surprises, J. Comput. Biol., to appear.
80. F. H. Chang, H. L. Fu, F.K. Hwang and B. C. Lin, The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks, preprint, 2004.
81. D.-Z. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications, World Scientific, 1999.
82. H. L. Fu and F. K Hwang, A novel use of i-packing to construct d-disjunct matrices, Disc. Appl. Math., to appear.
83. F. K. Hwang, On Macula’s error-correcting pool designs, Discrete Mathematics, 267 (2003) 311-314.
84. T. Huang and C.-W. Weng, Pooling spaces and non-adaptive pooling designs, Discrete Mathematics 282 (2004) 163-169.
85. A. J. Macula, A simple construction of d-disjunct matrices, Discrete Mathematics, 162 (1996) 311-312.
86. e-disjunct matrices, Discrete Appl. Math. 80 (1997) 217-222.
87. A. J. Macula, Probabilistic nonadaptive group testing in the presence of errors and DNA library screening, Annals of Combinatorics 2 (1999) 61-69.
88. A. J. Macula, Trivial two-stage group testing with high error rates, Journal of Combinatorial Optimization, 7 (2003) 361-368.
89. H.Q. Ngo and D.-Z. Du, New constructions of non-adaptive and error-tolerance pooling designs, Discrete Mathematics 243 (2002) 161-170.
90. H. Q. Ngo and D.-Z. Du, A Survey on combinatorial group testing algorithms with applications to DNA library screening, in Discrete Mathematical Problems with Medical Applications, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 55 (Amer. Math. Soc., Providence, RI, 2000) pp. 171-182.
91. J. H. van Lint and R. M. Wilson, A Course in Combinatorics, Cambridge University Press, Cambridge, 1992.
92. H. Park, W. Wu, X. Wu and H. G. Zhao, DNA screening, nonadaptive group testing and simplicial complex, Journal of Combinatorial Optimization, 7 (2003) 389-394.
93. W. Wu, Y. Huang, X. Huang and Y. Li, On error-tolerant DNA screening, Discrete Applied Mathematics, to appear.
94. J. Balding, W. J. Bruno, E. Knill and D.C. Torney, A comparative survey of non-adaptive pooling designs, in Genetic Mapping and DNA Sequencing, IMA Volumes in Mathematics and Its Applications, (Springer Verlag, 1995) pp. 133-155.
95. D. J. Bruno, E. Knill, D. J. Balding, D. C. Bruce, N. A. Doggett, W. W. Sawhill, Ft. L. Stalling, C. C. Whittaker and D. C. Torney, Efficient pooling designs for library screening, Genomics, 26 (1995) 21-30.
96. H. B. Chen, P. K. Hwang and Y. M. Li, Bounding the number of columns which only appear in positive pools, Taiwanese J. Math., to appear.
97. A. De Bonis, L. Gasieniec and U. Vaccaro, Optimal two-stage algorithms for group testing problems, SIAM J. Comput., 34 (2005) 1253-1270.
98. A. G. D’yachkov, On a search model of false coins, Colloq. Math. Soc. Janos Bolyai Topics in Inform. Thy. Keszthely, Hungary, 1975, pp. 163-170.
99. P. Erdos and A. Renyi, On two problems of information theory, Publ. Math. Inst. Hung. Acad. Sci., 8 (1963) 241-254.
100. F. K. Hwang, Random k-set pool designs with distinct columns, Prob. Eng. Inform. Sci., 14 (2000) 49-56.
101. F. K. Hwang and Y. C. Liu, The expected number of unresolved positive clones in various random pool designs, Prob. Eng. Inform. Sci. 15 (2001) 57-68.
102. F. K. Hwang and Y. C. Liu, A general approach to compute the probabilities of unresolved clones in random pooling designs, to appear in Prob. Eng. Inform. Sci., 18 (2004) 161-183.
103. F. K. Hwang and Y. C. Liu, Random pooling designs under various structures, Journal of Combinatorial Optimization, 7 (2003) 339-352.
104. A. J. Macula, A simple construction of disjunct matrices with certain weights, Disc. Math., 80 (1997) 311-312.
105. A. J. Macula, Probabilistic nonadaptive group testing in the presence of errors and DNA library screening, Ann. Comb., 1 (1999) 61-69.
106. J. K. Percus, O. E. Percus, W. J. Bruno and D. C. Torney, Asymptotics of pooling design performance, J. Appl. Prob., 36 (1999) 951-964.
107. A. Sebo, On two random search problem, J. Statist. Plan. Infer., 11 (1985) 23-31.
108. D. J. Schultz, Topics in nonadaptive group testing, Ph.D. Thesis, Temple Univ., 1992.
109. M. Aigner, Search problems on graphs, Disc. Appl. Math., 14 (1986) 215-230.
110. H. B. Chen, D.-Z. Du and F. K. Hwang, An unexpected meeting of four seemily unrelated problems: graph testing, DNA complex secreening, superimposed codes and secure key distribution, preprint, 2005.
111. G. J. Chang and F. K. Hwang, A group testing problem, SIAM J. Ala. Disc. Methods, 1 (1980) 21-24.
112. T. Chen and F. K. Hwang, A competitive algorithm in searching for many edges in a hypergraph, 2003, preprint.
113. P. Damaschke, A tight upper bound for group testing in graphs, Disc. Appl. Math., 48 (1994) 101-109.
114. D.-Z. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications, World Scientific, Singapore, 1993.
115. D.-Z. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications, 2nd edition, World Scientific, Singapore, 2000.
116. A. Dyachkov, P. Villenkin, A. Macula and D. Torney, On families of subsets where no intersection of ¿-subsets is covered by the union of s others, J. Combin. Thy. (Series A), 99 (2002) 195-218.
117. K. Engel, Interval packing and covering in the boolean lattice, Combin. Probab. Compul., 5 (1996) 373-384.
118. H. Gao, F.K. Hwang, M. Thai, W. Wu and T. Znati, Construction of disjunct matrices for group testing in the complex model, manuscript.
119. F. K. Hwang, A competitive algorithm to find all defective edges in a graph, Disc. Appl. Math., 148 (2005) 273-277.
120. P. Johann, A group testing problem for graphs with several defective edges, Disc. Appl. Math., 117 (2002) 99-108.
121. H. K. Kim and V. Lebedev, On optimal superimposed codes, J. Combin. Design, 12 (2004) 79-91.
122. Y. Li, M. Thai, Z. Liu and W. Wu, Protein-to-protein interactions and group testing in bipartite graphs, International Journal of Bioinformatics and Applications, 1 (2005) 414-419.
123. A. J. Macula and L. J. Popyack, A group testing method for finding patterns in data, Disc. Appl. Math., 144 (2004) 149-157.
124. A. J. Macula, V. V. Rykov and S. Yekhanin, Trivial two-stage group testing for complexes using almost disjunct matrices, Disc. Appl. Math.
125. A. J. Macula, D. C. Torney, and P.A. Villenkin, Two-stage group testing for complexes in the presence of errors, DIMACS Series in Disc. Math, and Theor. Comput. Sci., 55 (2000) 145-157.
126. C. J. Mitchell and F. C. Piper, Key storage in secure networks, Disc. Appl. Math., 21 (1988) 215-228.
127. Y. L. Sagalovich, On separating systems, Problemy Peredachi Informatsii, 30 (1994) 14-35 (in Russian).
128. D. R. Stinson, On some methods for unconditionally secure key distribution and broadcast encryption, Designs, Codes, Crypto., 12(1997) 215-343.
129. D. R. Stinson and R. Wei, Generalized cover-free families, Disc. Math., 27 (2004) 463-477.
130. D. R. Stinson, R. Wei and L. Chu, Some new bounds for cover-free families, J. Combin. Thy. Series A, 90 (2000) 224-234.
131. D. C. Torney, Sets pooling designs, Ann. Combin., 3(1999) 95-101.
132. E. Triesch, A group testing problem for hypergraphs of bounded rank, Disc. Appl. Math., 66 (1996) 185-188.
133. H. Wang and C. Xing, Explicit construction of perfect hash families from algebraic curves over finite fields, J. Combin. Thy. Ser. A, 93 (2001) 112-124.
134. N. Alon, R. Beigel, S. Kasif, S. Rudich and B. Sudakov, Learning a hidden matching, SIAM J. Comput., 33 (2004) 487-501.
135. N. Alon and J. H. Spencer, The probabilistic MethodSecond Edition, Wiley, New York, 2000.
136. R. Beigel, N. Alon, M. S. Aprydin, L. Fortnow and S. Kasif, An optimal procedure for gap closing in whole genome shotgun sequencing, Proc. RECOMB, ACM Press, 2001, pp. 22-30.
137. D. G. Cantor and W. H. Mills, Determination of a subset from some combinatorial properties, Can. J. Math., 18 (1966) 42-48.
138. D. Damaschke, A tight upper bound for group testing in graphs, Disc. Appl. Math., 48 (1994) 101-109.
139. P. Erdos and A. Renyi, On two problems of information theory, Bubl. Hungarian Acad. Sci., 8 (1963) 241-254.
140. V. Grebinski and G. Kucherov, Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping, Disc. Appl. Math., 88 (1998) 147-165.
141. V. Grebinski and G. Kucherov, Optimal reconstruction of graphs under the additive model, Algorithmica, 25 (2000) 104-124.
142. F. K. Hwang and W. D. Lin, The incremental group testing model for gap closing in sequencing long molecules, J. Combin. Opt. 7 (2003) 327-337.
143. B. Lindstiom, On a combinatorial problem in number theory, Canad. J. Math., 8 (1965) 402-407.
144. B. Lindstrom, Determination of two vertices from a sum, J. Combin. Thy., A6 (1969) 402-407.
145. H. Tettelin, D. Radune, S. Kasif, H. Khousi and S. L. Salzberg, Optimized multiplex PCR: Efficiently closing a whole genome shotgun sequencing project, Genomics 62 (1999) 500-507.
146. R. M. Wilson, Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congressus Numeratium, 15 (1975) 647-659.
147. A. De Bonis, L. Gasieniec and U. Vaccaro, Optimal two-stage algorithms for group testing problems, SIAM J. Comput., 34 (2005) 1253-1270.
148. A. De Bonis and U. Vaccaro, Improved algorithms for group testing with inhibitors, Inform. Proc. Lett., 67(1998) 57-64.
149. A. De Bonis and U. Vaccaro, Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels, Theor. Comput. Sci. A., 306 (2003) 223-243.
150. F. H. Chang and F. K. Hwang, The identification of positive clones in a general inhibitor model, preprint, 2005.
151. F. H. Chang, H. L. Chang and F. K. Hwang, Pooling designs for clone library screening in the inhibitor-complex model, preprint, 2006.
152. A. G. Dyachkov, A. J. Macula, D. C. Torney and P.A. Villenkin, Two models of nonadaptive group testing for designing screening experiments, in A. C Atkinson, P. Hackl and W. G. Muller (Eds.): Proc. 6th Intern. Workshop on Model-oriented design and analysis, pp. 63-75, Physica-Velay, 2001.
153. A. Dyachkov and V. Rykov, Bounds on the length of disjunctive code, Prob. Control Inform. Thy., 11 (1982) 7-13.
154. D.-Z. Du and F. K. Hwang, Identifying d Positive Clones in the Presence of Inhibitors, International Journal of Bioinfomatics and Applications, 1 (2005) 162-168.
155. M. Farach, S. Kannan, E. Knill and S. Muthukrishuan, Group testing problems with sequences in experimental molecular biology, Proc. Compression and Complexity of Sequences, B. Cayertieu et al. (Eds.) IEEE Press, 1997, pp. 357-367.
156. F. K. Hwang and Y. C. Liu, Error-Tolerant pooling designs with inhibitors, J. Comput. Biol., to appear.
157. E. Barillot, B. Lacroix and D. Cohen, Theoretical analysis of library screening using a jV-dimensional pooling strategy, Nucleic Acids Res., 19 (1991) 6241-6247.
158. T. Berger, J. W. Mandell and P. Subrahmanya, Maximally efficient two-stage screening, Biometrics, 56 (2000) 833-840.
159. W. W. Cai, C. W. Chow, S. Damani, G. Simon and A. Bradly, A SSLD anchored BAC framework map of the mouse genome, Nat. Genet., to appear.
160. J. E. Carter, Designs on cubic multigraphs, Ph.D. Thesis, McMaster University, 1989.
161. M. A. Chateauneuf, C.C. Colbourn, D.L. Kreber, E.R. Lamken and D.C. Torney, Pooling, lattice square and union jack designs, Ann. Combin. 3 (1999) 27-35.
162. P. J. De Jong, C. Aslanidis, J. Alleman and C. Chen, Genome mapping and sequencing, Proc. Cold Spring Harbor Workshop, New York 1990, pp. 48.
163. S. El-Zanati, M. Plantholt and C. V. Eynden, Graph decompositions into generalized cubes, Ars Combinatoria, 49 (1998) 237-247.
164. c’s, J. Statist. Plan. Infor., to appear.
165. T. S Fu and K. S. Lin, Lattice hypercube designs, Disc. Appl. Math., 131 (2003) 673-680.
166. T. S Fu and K. S. Lin, A uniformed construction of two-dimensional pooling designs, Ann. Combin. 8 (2004) 155-159.
167. M. J. Grannel and T. S. Griggs, Product constructions for cyclic block designs: Steiner-2 designs, J. Combin. Thy. A, 42(1986) 129-183.
168. E. D. Green and M. V. Olson, Systematic screening of yeast artificial chromosone libraries by use of the polymer chain reaction, Proc. Nat. Acad. Sci., USA, 87 (1990) 1213-1217.
169. H. M. Huang, F. K. Hwang and J. F. Ma, Using transforming matrices to generate DNA clone grids, Disc. Appl. Math., 129 (2003) 421-431.
170. E. Hubbell, Multiplex sequencing by hybridization, Journal of Computational Biology, Vol 8, No 2 (2001) 141-149.
171. F. K. Hwang, An isomorphic factorization of the complete graph, J. Combin. Thy., 19 (1995) 333-337.
172. A. Kotzig, On decomposition of complete graph into 4fc-gons, Math.-Fyz. Cas., 15 (1965) 227-233.
173. R. J. McEliece, Finite Fields for Computer Scientists and Engineers, Kluwer Berlin, 1987.
174. Y. Mutoh, M. Jimbo and H. L. Fu, A resolvable r x c grid-block packing and its application to DNA library screening, preprint.
175. Y. Mutoh, T. Monhara, M. Jimbo and H. L. Fu, The existence of 2 x 4 grid designs and its applications, SIAM J. Disc. Math., to appear.
176. Y. Mutoh and D. G. Sarvate, A 2 x 2 grid design, Congr. Numer., 149 (2001) 193-199.
177. P. A. Pevzner, Computational Molecular Biology: an Algorithmic Approach, MIT Press, Massachusetts, 2000.
178. R. M. Phatarfod and A. Sudbury, The use of a square array scheme in blood testing, Statistics in Medicine, 13 (1994) 2337-1343.
179. D. Raghavarro, Constructions and Combinatorial Problems in Designs of Experiments, Wiley, New York, 1971.
180. D.-Z. Du and K.-I Ko, Some completeness results on decision trees and group testing, SIAM Algebraic and Discrete Methods, 8 (1987) 762-777.
181. D.-Z. Du and K.-I Ko, Design and Analysis of Approximation Algorithms, manuscript, 2006.
182. M.E. Garey and D.S. Johnson, Computers and Intractability, (W.H. Freeman, San Francisco, 1979).
183. G. Klau, S. Rahmann, A. Schliep, M. Vingron, and K. Reinert, Optimal robust non-unique probe selection using integer linear programming, Bioinformatics, 20 (2004) 1186-1193.
184. A. Schliep, D. C. Torney and S. Rahmann, Group testing with DNA chips: generating designs and decoding experiments, Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003.
185. M. Thai, P. Deng, D. MacCallum and W. Wu, Dealing with non-unique probes with d-disjunct matrices, manuscript, 2006.