
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Hiroaki Uehara, Masakazu Jimbo, "A Positive Detecting Code and Its Decoding Algorithm for DNA Library Screening," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 6, no. 4, pp. 652666, OctoberDecember, 2009.  
BibTex  x  
@article{ 10.1109/TCBB.2007.70266, author = {Hiroaki Uehara and Masakazu Jimbo}, title = {A Positive Detecting Code and Its Decoding Algorithm for DNA Library Screening}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {6}, number = {4}, issn = {15455963}, year = {2009}, pages = {652666}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2007.70266}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  A Positive Detecting Code and Its Decoding Algorithm for DNA Library Screening IS  4 SN  15455963 SP652 EP666 EPD  652666 A1  Hiroaki Uehara, A1  Masakazu Jimbo, PY  2009 KW  DNA library screening KW  highthroughput screening KW  pooling experiment KW  two stage test KW  group testing KW  Bayesian network KW  sumproduct algorithm KW  LDPC. VL  6 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] E. Barillot, B. Lacroix, and D. Cohen, “Theoretical Analysis of Library Screening Using an $N\hbox{}{\rm Dimensional}$ Pooling Strategy,” Nucleic Acids Research, vol. 19, no. 22, pp. 62416247, 1991.
[2] T. Berger, J.W. Mandell, and P. Subrahmanya, “Maximally Efficient TwoStage Screening,” Biometrics, vol. 56, no. 3, pp.833840, 2000.
[3] 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, no. 1, pp. 2130, 1995.
[4] D.Z. Du and F.K. Hwang, Combinatorial Group Testing and Its Application. World Scientific, 2000.
[5] A.G. D'yachkov, F.K. Hwang, A.J. Macula, P.A. Vilenkin, and C. Weng, “A Construction of Pooling Designs with Some Happy Surprises,” J. Computational Biology, vol. 12, no. 8, pp. 11291136, 2005.
[6] R.G. Gallager, “LowDensity ParityCheck Codes,” IRE Trans. Information Theory, vol. 8, pp. 2128, 1962.
[7] E. Knill, A. Schliep, and D.C. Torney, “Interpretation of Pooling Experiments Using the Markov Chain Monte Carlo Method,” J.Computational Biology, vol. 3, no. 3, pp. 395406, 1996.
[8] D.J.C. MacKay and R.M. Neal, “Near Shannon Limit Performance of Low Density Parity Check Codes,” IEE Electronics Letters, vol. 32, no. 18, pp. 16451655, 1996.
[9] A.J. Macula, “Probabilistic Nonadaptive Group Testing in the Presence of Errors and DNA Library Screening,” Ann. Combinatorics, vol. 3, no. 1, pp. 6169, 1999.
[10] M. Mézard and C. Toninelli, “Group Testing with Random Pools: Optimal TwoStage Algorithms,” arXiv:0706.3104, 2007.
[11] W.H. Mills and R.C. Mullin, “Coverings and Packings,” Contemporary Design Theory: A Collection of Surveys, J.H. Dinitz and D.R. Stinson, eds., pp. 317399, John Wiley & Sons, 1992.
[12] H.Q. Ngo and D.Z. Du, “A Survey on Combinatorial Group Testing Algorithms with Applications to DNA Library Screening,” Discrete Math. Problems with Medical Applications, DIMACS Ser. Discrete Math. and Theoretical Computer Science, vol. 55, pp. 171182, 2000.
[13] J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1997.
[14] P. Sham, J.S. Bader, I. Craig, M. O'Donovan, and M. Owen, “DNA Pooling: A Tool for LargeScale Association Studies,” Nature Rev. Genetics, vol. 3, no. 11, pp. 862871, Nov. 2002, .
[15] N. ThierryMieg, “A New Pooling Strategy for HighThroughput Screening: The Shifted Transversal Design,” BMC Bioinformatics, vol. 7, no. 28, 2006.
[16] W. Wu, Y. Li, C.H. Huang, and D.Z. Du, “Molecular Biology and Pooling Design,” Proc. Workshop Data Mining in Biomedicine (DMB '04), Feb. 2004.
[17] http://www.nature.com/reviews/geneticshttp:/ /jim.math.cm.is.nagoyau.ac.jp/~uehara bnpd/, 2008.
[18] http:/algorithmics.molgen.mpg.de/, 2008.