Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Berman P, Dasgupta B, Kao M-Y (2005) Tight approximability results for test set problems in bioinformatics. J Comput Syst Sci 71:145–162
De Bontridder KMJ, Halldórsson BV, Halldórsson MM, Hurkens CAJ, Lenstra JK, Ravi R, Stougie L (2003) Approximation algorithms for the test cover problem. Math Program 98:477–491
Du D-Z, Hwang FK (2006) Pooling designs and nonadaptive group testing. World Scientific, New Jersey
Du D-Z, Ko K-I (2000) Theory of computational complexity. Wiley, New York
Garey MR, Johnson DS (1979) Computers and intractability. W.H. Freeman, San Francisco
Halldórsson BV, Halldórsson MM, Ravi R (2001) On the approximability of the minimum test collection problem. Lect Notes Comput Sci 2161:158–169
Karp RM, Stougton R, Yeung KY (1999) Algorithms for choosing differential gene expression experiments. In: Proceedings of the third annual international conference on computational molecular biology, Lyon, pp 208–217
Klau G, Rahmann S, Schliep A, Vingron M, Reinert K (2004) Optimal robust non-unique probe selection using integer linear programming. Bioinformatics 20:I186–I193
Schliep A, Torney DC, Rahmann S (2003) Group testing with DNA chips: generating designs and decoding experiments. In: Proceedings of the 2nd IEEE computer society bioinformatics conference, Stanford
Thai M, Deng P, Wu W, Znati T (2006) Efficient algorithms for non-unique probes selection using d-disjunct matrix. Muscript
Wang F, Du H, Jia X, Deng P, Wu W, MacCallum D (2007) Non-unique probe selection and group testing. Theor Comput Sci 381:29–32¡?pag ?¿
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Xu, W., Wu, W., Du, DZ. (2016). Probe Selection. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_615
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_615
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering