Skip to main content

Advertisement

SpringerLink
Log in

An Optimal Cutting-Plane Algorithm for Solving the Non-Unique Probe Selection Problem

  • Published:
Annals of Biomedical Engineering Aims and scope Submit manuscript

Abstract

The non-unique probe selection problem consists of selecting oligonucleotide probes for use in hybridization experiments in which target viruses or bacteria are to be identified in biological samples. The presence or absence of these targets is determined by observing whether selected probes bind to their corresponding sequences. The goal is to select a probe set that is able to uniquely identify targets while containing a minimal number of probes. This paper contributes the first exact method for finding optimal solutions to the non-unique probe selection problem within practical computational limits, without the a priori elimination of candidate probes. Previously published methods have employed heuristics to find approximate solutions that are not provably optimal, and as a result, no knowledge has been obtained regarding the quality of those solutions relative to optimality. We demonstrate that our approach consistently finds an optimal solution to the non-unique probe selection problem within 10 min, and is capable of reducing the number of probes required over state-of-the-art heuristic techniques by as much as 20%.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barnes R. S. K., Hughes R. N. (1999) An Introduction to Marine Ecology. Malden, MA: Blackwell Science, pp. 296

    Google Scholar 

  2. Borneman J., Chroback M., Vedova G. D., Figueroa A., Jiang T. (2001) Probe selection algorithms with applications in the analysis of microbial communities. Bioinformatics 17:S39–S48

    PubMed  Google Scholar 

  3. Conejero-Goldberg C., Wang E., Yi C., Goldberg T. E., Jones-Brando L., Marincola F. M., Webster M. J., Torrey E. F. (2005) Infectious pathogen detection arrays: Viral detection in cell lines and postmortem brain tissue. BioTech. 39:741–751

    Article  CAS  Google Scholar 

  4. de Souza, P. S., and S. N. Talukdar. Asynchronous organizations for MultiAlgorithm problems. In: Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice. Indianapolis, IN, pp. 286–293.

  5. Garey M. R., Johnson D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY: W. H. Freeman and Co, 340 pp.

    Google Scholar 

  6. Huang Y., Chang C., Chan C., Yeh T., Chang Y., Chen C., Kao C. (2005) Integrated minimum-set primers and unique probe design algorithms for differential detection on symptom-related pathogens. Bioinformatics 21:4330–4337

    Article  PubMed  CAS  Google Scholar 

  7. Klau G. W., Rahmann S., Schliep A., Vingron M., Reinert K. (2004) Optimal robust non-unique probe selection using integer linear programming. Bioinformatics 20:186–193

    Article  CAS  Google Scholar 

  8. Klau, G. W., S. Rahmann, A. Schliep, M. Vingron, and K. Reinert. Integer linear programming approaches for non-unique probe selection. (To appear in Discr. App. Math, 2006)

  9. Knudsen S (2004) Guide to Analysis of DNA Microarray Data., 2nd Ed. New York, NY: John Wiley & Sons, Ltd.,184 pp.

    Google Scholar 

  10. Meneses C. N., P. M. Pardalos, and M. A. Ragle. A survey of computational methods for probe design and selection. To appear in: Optimization in Medicine and Biology, edited by G. J. Lim. New York: Auerbach, 2008.

  11. Meneses C. N., Pardalos P. M., Ragle M. A. (2007) A new approach to the non-unique probe selection problem. Ann. Biomed. Eng. 35:651–658

    Article  PubMed  Google Scholar 

  12. Nemhauser G. L., Wolsey L. A. (1999) Integer and Combinatorial Optimization. New York, NY: John Wiley & Sons, Ltd, 763 pp.

    Google Scholar 

  13. Nordberg E. K. (2005) YODA: selecting signature oligonucleotides. Bioinformatics 21:1365–1370

    Article  PubMed  CAS  Google Scholar 

  14. Rash, S., and D. Gusfield. String barcoding: Uncovering optimal virus signatures. In: Proceedings of the Sixth Annual International Conference on Computational Biology. edited by G. Meyers, S. Hannenballi, S. Istrail, P. Perzner, and M. Waterman. Washington, DC, 2002, pp. 254–261.

  15. Roth S. B., Jalava J., Ruuskanen O., Ruohola A., Nikkari S. (2004) Use of an oligonucleotide array for laboratory diagnosis of bacteria responsible for acute upper respiratory infections. J. Clin. Microbiol. 42:4268–4274

    Article  PubMed  CAS  Google Scholar 

  16. Rozen S., Skaletsky H. J. (2000) Primer3 on the WWW for general users and for biologist programmers. In Krawetz S., Misener S. (eds) Bioinformatics Methods and Protocols: Methods in Molecular Biology. Totowa, NJ: Humana Press, pp. 365–386

    Google Scholar 

  17. Schliep, A., D. C. Torney, and S. Rahmann. Group testing with DNA chips: generating designs and decoding experiments. In: Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference (CSB 2003), edited by G. Meyers, S. Hannenballi, S. Istrail, P. Perzner, and M. Waterman. Stanford, CA, 2003, pp. 84–93

Download references

Acknowledgements

The authors gratefully acknowledge the comments made by two referees and an Associate Editor that led to the improvement of this paper’s exposition. We are grateful to Dr. Sven Rahmann for providing us with some of the data used in this paper. This work was partially supported by NIH, NSF and Air Force grants.

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, FL, 32611, USA

    Michelle A. Ragle, J. Cole Smith & Panos M. Pardalos

Authors
  1. Michelle A. Ragle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Cole Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michelle A. Ragle.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ragle, M.A., Smith, J.C. & Pardalos, P.M. An Optimal Cutting-Plane Algorithm for Solving the Non-Unique Probe Selection Problem. Ann Biomed Eng 35, 2023–2030 (2007). https://doi.org/10.1007/s10439-007-9374-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10439-007-9374-y

Keywords

Search

Navigation