Skip to main content

Probe Selection

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms
  • 46 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Berman P, Dasgupta B, Kao M-Y (2005) Tight approximability results for test set problems in bioinformatics. J Comput Syst Sci 71:145–162

    Article  MathSciNet  MATH  Google Scholar 

  2. 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

    Article  MathSciNet  MATH  Google Scholar 

  3. Du D-Z, Hwang FK (2006) Pooling designs and nonadaptive group testing. World Scientific, New Jersey

    MATH  Google Scholar 

  4. Du D-Z, Ko K-I (2000) Theory of computational complexity. Wiley, New York

    Book  MATH  Google Scholar 

  5. Garey MR, Johnson DS (1979) Computers and intractability. W.H. Freeman, San Francisco

    MATH  Google Scholar 

  6. 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

    Article  MathSciNet  MATH  Google Scholar 

  7. 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

    Google Scholar 

  8. 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

    Article  MATH  Google Scholar 

  9. 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

    Google Scholar 

  10. Thai M, Deng P, Wu W, Znati T (2006) Efficient algorithms for non-unique probes selection using d-disjunct matrix. Muscript

    Google Scholar 

  11. 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 ?¿

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ding-Zhu Du .

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics