Single-user tracing and disjointly superimposed codes

IEEE Transactions on Information Theory

Volumn 51, Issue 4, 2005, Pages 1606-1611

  Csurös, Miklós ^a   Ruszinkó, Miklós ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Codes; Group testing; Physical mapping; Superimposed codes

Indexed keywords

CODES (SYMBOLS); MARKOV PROCESSES; PROBABILITY; SET THEORY; THEOREM PROVING; VECTORS;

GROUP TESTING; MARKOV INEQUALITY; PHYSICAL MAPPING; SINGLE USER TRAINING; SUPERIMPOSED CODES;

CHANNEL CAPACITY;

EID: 17744369952     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.844097     Document Type: Article

References (24)

1. A. G. D'yachkov and V. V. Rykov, "Bounds on the length of disjunctive codes," Probl. Pered. Inf., vol. 18, no. 3, pp. 7-13, 1982.
2. P. Erd″os, P. Frankl, and Z. Füredi, "Families of finite sets in which no set is covered by the union of r others" Israel J. Math., vol. 51, pp. 79-89, 1985.
3. F. K. Hwang and V. T. Sós, "Non-adaptive hypergeometric group testing" Stud. Sci. Math. Hungar., vol. 22, pp. 257-263, 1987.
4. Z. Füredi, "A note on r-cover-free families," J. Combin. Theory Ser. A, vol. 73, pp. 172-173, 1996.
5. W. H. Kautz and R. C. Singleton, "Nonrandom binary superimposed codes" IEEE Trans. Inf. Theory, vol. IT-10, no. 4, pp. 363-377, Oct. 1964.
6. M. Ruszinkö, "On the upper bound of the size of the r -cover-free families" J. Combin. Theory Ser. A, vol. 66, pp. 302-310, 1994.
7. C. C. Colbourn, A. C. H. Ling, and M. Tompa, "Construction of optimal quality control for oligo arrays" Bioinformatics, vol. 18, no. 4, pp. 529-535, 2002.
8. R. Beigel, N. Alon, S. Kasif, M. S. Apaydin, and L. Fortnow, "An optimal procedure for gap closing in whole genome shotgun sequencing" in Proc. 5th Annu. Int. Conf. Computational Biology (RECOMB), Montreal, QC, Canada, Apr. 22-25, 2001, pp. 22-30.
9. D. J. Balding, W. J. Bruno, E. Knill, and D. C. Torney, "A comparative survey of nonadaptive pooling designs," in Genetic Mapping and DNA Sequencing, T. Speed and M. S. Waterman, Eds. New York: Springer-Verlag, 1996, vol. 81, IMA volumes in mathematics and its applications, pp. 133-154.
10. E. D. Green, "Strategies for the systematic sequencing of complex genomes" Nat. Rev. Genet., vol. 2, pp. 573-583, 2001.
11. "International human genome sequencing consortium, "Initial sequencing and analysis of the human genome"," Nature, vol. 609, no. 6822, pp. 860-921, 2001.
12. E. Barillot, B. Lacroix, and D. Cohen, "Theoretical analysis of library screening using an n-dimensional strategy," Nucl. Acids Res. vol. 19, pp. 6241-6247, 1991.
13. W.J. Bruno, E. Knill, D. J. Balding, D. C. Bruce, N. A. Doggett, W. W. Sawhill, R. L. Stallings, C. C. Whittaker, and D. C. Torney, "Efficient pooling designs for library screening," Genomics, vol. 26, pp. 21-30, 1995.
14. M. A. Chateauneuf, C. J. Colbourn, D. L. Kreher, E. R. Lamken, and D. C. Torney, "Pooling, lattice square, and Union Jack designs," Ann. Combin., vol. 3, pp. 27-35, 1999.
15. A. G. D'yachkov, A. J. Macula Jr., and V. V. Rykov, "New constructions of superimposed codes," IEEE Trans. Inf. Theory, vol. 46, no. 1, pp. 284-290, Jan. 2000.
16. A. J. Macula, "Probabilistic nonadaptive group testing in the presence of errors and DNA library screening," Ann. Combin., vol. 3, pp. 61-69, 1999.
17. H.Q. Ngo and D.-Z. Du, "New constructions of nonadaptive and error-tolerance pooling designs," Discr. Math., vol. 243, pp. 161-170, 2002.
18. W.-W. Cai, R. Chen, R. A. Gibbs, and A. Bradley, "A clone-array pooled strategy for sequencing large genomes," Genome Res., vol. 11, pp. 1619-1623, 2001.
19. M. Cs″urös and A. Milosavljevic, "Pooled genomic indexing (PGI): Analysis and design of experiments," J. Comput. Biol., vol. 11, no. 5, pp. 1001-1021, 2004.
20. E. S. Lander and M. S. Waterman, "Genomic mapping by fingerprinting random clones: A mathematical analysis," Genomics, vol. 2, pp. 231-239, 1988.
21. N. Alon, E. Fachini, and J. Körner, "Locally thin set families," Comb., Prob. Comput., vol. 9, pp. 481-488, 2000.
22. Z. Füredi, A. Gyárfás, and M. Ruszinkó, "On the maximum size of (p, Q)-free families," Discr. Math., vol. 257, pp. 385-403, 2002.
23. W. Feller, An Introduction to Probability Theory and its Applications New York: Wiley, 1966.
24. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups, 2nd ed. New York: Springer-Verlag, 1993.