Combinatorial Optimization Algorithms

  • Elisa Pappalardo
  • Beyza Ahlatcioglu Ozkok
  • Panos M. Pardalos
Reference work entry

Abstract

Identification of targets, generally virus or bacteria, in a biological sample is a relevant problem in medicine. Biologists can use hybridization experiments to determine whether a specific DNA fragment, that represents the virus, is present in a DNA solution. A probe is a segment of DNA or RNA, labeled with a radioactive isotope, dye, or enzyme, used to find a specific target sequence on a DNA molecule by hybridization. Selecting unique probes through hybridization experiments is a difficult task, especially when targets have a high degree of similarity, for instance, in case of closely related viruses.The nonunique probe selection problem is a challenging problem from a biological and computational point of view; a plethora of methods have been proposed in literature ranging from evolutionary algorithms to mathematical programming approaches.In this study, we conducted a survey of the existing computational methods for probe design and selection. We introduced the biological aspects of the problem and examined several issues related to the design and selection of probes: oligonucleotide fingerprinting, maximum distinguishing probe set, minimum cost probe set, and nonunique probe selection.

Keywords

Sugar Entropy Hydroxyl Enthalpy Radioactive Isotope 

Recommended Reading

  1. 1.
    D.G. Albertson, D. Pinkel, Genomic microarrays in human genetic disease and cancer. Hum. Mol. Genet. 12(Review Issue 2), R145 (2003)CrossRefGoogle Scholar
  2. 2.
    R.S.K. Barnes, R.N. Hughes, An Introduction to Marine Ecology (Wiley, Oxford/Malden, 1999)CrossRefGoogle Scholar
  3. 3.
    J.E. Beasley, P.C. Chu, A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392–404 (1996)CrossRefMATHGoogle Scholar
  4. 4.
    J.M. Berg, J.L. Tymoczko, L. Stryer, Biochemistry (Looseleaf) (Freeman, San Francisco 2008)Google Scholar
  5. 5.
    J. Borneman, M. Chrobak, G. Della Vedova, A. Figueroa, T. Jiang, Probe selection algorithms with applications in the analysis of microbial communities. Bioinformatics 17(Suppl 1), S39 (2001)CrossRefGoogle Scholar
  6. 6.
    Z. Bozdech, J. Zhu, M.P. Joachimiak, F.E. Cohen, B. Pulliam, J.L. DeRisi, et al., Expression profiling of the schizont and trophozoite stages of Plasmodium falciparum with a long-oligonucleotide microarray. Genome Biol. 4(2), R9 (2003)CrossRefGoogle Scholar
  7. 7.
    A. Caprara, M. Fischetti, P. Toth, A heuristic method for the set covering problem. Oper. Res. 47(5), 730–743 (1999)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    D. Cazalis, T. Milledge, G. Narasimhan, Probe selection problem: structure and algorithms, in Proceedings of the 8th Multi-Conference on Systemics, Cybernetics and Informatics (SCI 2004) (Citeseer, 2004), pp. 124–129Google Scholar
  9. 9.
    Y. Charbonnier, B. Gettler, P. François, M. Bento, A. Renzoni, P. Vaudaux, W. Schlegel, J. Schrenzel, A generic approach for the design of whole-genome oligoarrays, validated for genomotyping, deletion mapping and gene expression analysis on Staphylococcus aureus. BMC Genomics 6(1), 95 (2005)CrossRefGoogle Scholar
  10. 10.
    H. Chen, B.M. Sharp, Oliz, a suite of Perl scripts that assist in the design of microarrays using 50 mer oligonucleotides from the 3’ untranslated region. BMC Bioinform. 3(1), 27 (2002)CrossRefGoogle Scholar
  11. 11.
    C.C. Chou, C.H. Chen, T.T. Lee, K. Peck, Optimization of probe length and the number of probes per gene for optimal microarray analysis of gene expression. Nucl. Acids Res. 32(12), e99 (2004)CrossRefGoogle Scholar
  12. 12.
    H.H. Chou, A.P. Hsia, D.L. Mooney, P.S. Schnable, Picky: oligo microarray design for large genomes. Bioinformatics 20(17), 2893–2902 (2004)CrossRefGoogle Scholar
  13. 13.
    F.S. Collins, M. Morgan, A. Patrinos, The Human Genome Project: lessons from large-scale biology. Science 300(5617), 286–290 (2003)CrossRefGoogle Scholar
  14. 14.
    T.M. Cover, J.A. Thomas, Elements of Information Theory (Wiley, New York, 2006)MATHGoogle Scholar
  15. 15.
    C. Debouck, P.N. Goodfellow, DNA microarrays in drug discovery and development. Nat. Genet. 21(1 suppl), 48–50 (1999)CrossRefGoogle Scholar
  16. 16.
    P. Deng, M. Thai, Q. Ma, W. Wu, Efficient non-unique probes selection algorithms for DNA microarray. BMC Genomics 9(Suppl 1), S22 (2008)CrossRefGoogle Scholar
  17. 17.
    P.S. de Souza, S.N. Talukdar, Asynchronous organizations for multi-algorithm problems, in Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice (ACM, New York, 1993), p. 293Google Scholar
  18. 18.
    D.Z. Du, F.K. Hwang, Pooling Designs: Group Testing in Molecular Biology (World Scientific, New Jersey, 2006)Google Scholar
  19. 19.
    S.J. Emrich, M. Lowe, A.L. Delcher, PROBEmer: a web-based software tool for selecting optimal DNA oligos. Nucl. Acids Res. 31(13), 3746 (2003)CrossRefGoogle Scholar
  20. 20.
    C.B. Epstein, R.A. Butow, Microarray technology–enhanced versatility, persistent challenge. Curr. Opin. Biotechnol. 11(1), 36–41 (2000)CrossRefGoogle Scholar
  21. 21.
    A. Figueroa, J. Borneman, T. Jiang, Clustering binary fingerprint vectors with missing values for dna array data analysis. J. Comput. Biol. 11(5), 887–901 (2004)CrossRefGoogle Scholar
  22. 22.
    L. Gasieniec, C.Y. Li, P. Sant, P.W.H. Wong, Efficient probe selection in microarray design, in 2006 IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology, 2006. CIBCB’06, Toronto (IEEE, 2007), pp. 1–8Google Scholar
  23. 23.
    L. Gasieniec, C.Y. Li, P. Sant, P.W.H. Wong, Randomized probe selection algorithm for microarray design. J. Theor. Biol. 248(3), 512–521 (2007)CrossRefGoogle Scholar
  24. 24.
    L.S. Ghoraie, R. Gras, L. Wang, A. Ngom, Bayesian optimization algorithm for the non-unique oligonucleotide probe selection problem, in Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics, Sheffield (Springer, 2009), pp. 365–376Google Scholar
  25. 25.
    L.S. Ghoraie, R. Gras, L. Wang, A. Ngom, Optimal decoding and minimal length for the non-unique oligonucleotide probe selection problem. Neurocomputing 73(13), 2407–2418 (2010)CrossRefGoogle Scholar
  26. 26.
    P.M.K. Gordon, C.W. Sensen, Osprey: a comprehensive tool employing novel methods for the design of oligonucleotides for DNA sequencing and microarrays. Nucl. Acids Res. 32(17), e133 (2004)CrossRefGoogle Scholar
  27. 27.
    E. Halperin, S. Halperin, T. Hartman, R. Shamir, Handling long targets and errors in sequencing by hybridization. J. Comput. Biol. 10(3–4), 483–497 (2003)CrossRefGoogle Scholar
  28. 28.
    E. Hartuv, A.O. Schmitt, J. Lange, S. Meier-Ewert, H. Lehrach, R. Shamir, An algorithm for clustering cDNA fingerprints. Genomics 66(3), 249–256 (2000)CrossRefGoogle Scholar
  29. 29.
    R. Herwig, A.J. Poustka, C. Muller, C. Bull, H. Lehrach, J. O’Brien, Large-scale clustering of cDNA-fingerprinting data. Genome Res. 9(11), 1093 (1999)CrossRefGoogle Scholar
  30. 30.
    R. Herwig, A.O. Schmitt, M. Steinfath, J. O’Brien, H. Seidel, S. Meier-Ewert, H. Lehrach, U. Radelof, Information theoretical probe selection for hybridisation experiments. Bioinformatics 16(10), 890 (2000)CrossRefGoogle Scholar
  31. 31.
    D.S. Hochba, Approximation algorithms for NP-hard problems. ACM SIGACT News 28(2), 40–52 (1997)CrossRefGoogle Scholar
  32. 32.
    J.H. Holland, Adaptation in Natural and Artificial Systems (MIT, Cambridge, 1992)Google Scholar
  33. 33.
    N. Homer, S. Szelinger, M. Redman, D. Duggan, W. Tembe, J. Muehling, J.V. Pearson, D.A. Stephan, S.F. Nelson, D.W. Craig, Resolving individuals contributing trace amounts of DNA to highly complex mixtures using high-density SNP genotyping microarrays. PLoS Genet. 4(8), e1000167 (2008)CrossRefGoogle Scholar
  34. 34.
    A.K. Jain, R.C. Dubes, Algorithms for Clustering Data (Prentice-Hall, Englewood Cliffs, 1988)MATHGoogle Scholar
  35. 35.
    L. Kaderali, A. Schliep, Selecting signature oligonucleotides to identify organisms using DNA arrays. Bioinformatics 18(10), 1340 (2002)CrossRefGoogle Scholar
  36. 36.
    S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, Optimization by simulated annealing. Science 220(4598), 671–680 (1983)MathSciNetCrossRefMATHGoogle Scholar
  37. 37.
    G.W. Klau, S. Rahmann, A. Schliep, M. Vingron, K. Reinert, Optimal robust non-unique probe selection using integer linear programming. Bioinformatics 20(suppl 1), i186 (2004)CrossRefGoogle Scholar
  38. 38.
    G.W. Klau, S. Rahmann, A. Schliep, M. Vingron, K. Reinert, Integer linear programming approaches for non-unique probe selection. Discret. Appl. Math. 155(6–7), 840–856 (2007)MathSciNetCrossRefMATHGoogle Scholar
  39. 39.
    D.P. Kreil, R.R. Russell, S. Russell, [4] microarray oligonucleotide probes. Methods Enzymol. 410, 73–98 (2006)Google Scholar
  40. 40.
    J.K. Lanctot, M. Li, B. Ma, S. Wang, L. Zhang, Distinguishing string selection problems, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, 1999, pp. 633–642Google Scholar
  41. 41.
    P. Larranaga, J.A. Lozano, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation (Springer, Berlin, 2002)CrossRefGoogle Scholar
  42. 42.
    F. Li, G.D. Stormo, Selection of optimal DNA oligos for gene expression arrays. Bioinformatics 17(11), 1067 (2001)CrossRefGoogle Scholar
  43. 43.
    X. Li, Z. He, J. Zhou, Selection of optimal oligonucleotide probes for microarrays using multiple criteria, global alignment and parameter estimation. Nucl. Acids Res. 33(19), 6114 (2005)CrossRefGoogle Scholar
  44. 44.
    D. Lipson, P. Webb, Z. Yakhini, Designing specific oligonucleotide probes for the entire S. cerevisiae transcriptome, in Algorithms in Bioinformatics (2002), pp. 491–505Google Scholar
  45. 45.
    D.J. Lockhart, H. Dong, M.C. Byrne, M.T. Follettie, M.V. Gallo, M.S. Chee, M. Mittmann, C. Wang, M. Kobayashi, H. Horton, et al., Expression monitoring by hybridization to high-density oligonucleotide arrays. Nat. Biotechnol. 14(13), 1675 (1996)CrossRefGoogle Scholar
  46. 46.
    J. MacQueen, et al., Some methods for classification and analysis of multivariate observations, in Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability: Statistics, vol. 1 (University of California Press, Berkeley, California, 1967), p. 281Google Scholar
  47. 47.
    J. Marmur, P. Doty, Thermal renaturation of deoxyribonucleic acids. J. Mol. Biol. 3(5), 585–594 (1961)CrossRefGoogle Scholar
  48. 48.
    S. Meier-Ewert, Global expression mapping of mammalian enomes, PhD thesis, University College, London, 1994Google Scholar
  49. 49.
    C.N. Meneses, Z. Lu, C.A.S. Oliveira, P.M. Pardalos, et al., Optimal solutions for the closest-string problem via integer programming. INFORMS J. Comput. 16(4), 419–429 (2004)MathSciNetCrossRefMATHGoogle Scholar
  50. 50.
    C.N. Meneses, P.M. Pardalos, M.A. Ragle, A new approach to the non-unique probe selection problem. Ann. Biomed. Eng. 35(4), 651–658 (2007)CrossRefGoogle Scholar
  51. 51.
    C.N. Meneses, P.M. Pardalos, M. Ragle, Asynchronous teams for probe selection problems. Discret. Optim. 5(1), 74–87 (2008)CrossRefMATHGoogle Scholar
  52. 52.
    B.G. Mirkin, Mathematical Classification and Clustering (Springer, Heidelberg, 1996)CrossRefMATHGoogle Scholar
  53. 53.
    R. Mrowka, J. Schuchhardt, C. Gille, Oligodb–interactive design of oligo DNA for transcription profiling of human genes. Bioinformatics 18(12), 1686 (2002)CrossRefGoogle Scholar
  54. 54.
    A. Ngom, L. Rueda, L. Wang, R. Gras, Selection based heuristics for the non-unique oligonucleotide probe selection problem in microarray design. Pattern Recognit. Lett. 31(14), 2113–2125 (2010)CrossRefGoogle Scholar
  55. 55.
    H.B. Nielsen, R. Wernersson, S. Knudsen, Design of oligonucleotides for microarrays and perspectives for design of multi-transcriptome arrays. Nucl. Acids Res. 31(13), 3491 (2003)CrossRefGoogle Scholar
  56. 56.
    E.K. Nordberg, YODA: selecting signature oligonucleotides. Bioinformatics 21(8), 1365 (2005)CrossRefGoogle Scholar
  57. 57.
    M. Pelikan, Bayesian optimization algorithm, in Hierarchical Bayesian Optimization Algorithm (Springer, Berlin/New York, 2005), pp. 31–48Google Scholar
  58. 58.
    P. Pudil, J. Novovicová, J. Kittler, Floating search methods in feature selection. Pattern Recognit. Lett. 15(11), 1119–1125 (1994)CrossRefGoogle Scholar
  59. 59.
    M.A. Ragle, Computational methods for the design and selection of hybridization probes, PhD thesis, D., University of Florida, 2007Google Scholar
  60. 60.
    M.A. Ragle, J.C. Smith, P.M. Pardalos, An optimal cutting-plane algorithm for solving the non-unique probe selection problem. Ann. Biomed. Eng. 35(11), 2023–2030 (2007)CrossRefGoogle Scholar
  61. 61.
    S. Rahmann, Fast and sensitive probe selection for dna chips using jumps in matching statistics, in Proceedings of the 2003 IEEE Bioinformatics Conference, 2003. CSB 2003, Stanford (IEEE, Washington, DC, 2003), pp. 57–64Google Scholar
  62. 62.
    S. Rahmann, Fast large scale oligonucleotide selection using the longest common factor approach. Int. J. Bioinform. Comput. Biol. 1(2), 343–362 (2003)CrossRefGoogle Scholar
  63. 63.
    S. Rahmann, Algorithms for probe selection and DNA microarray design. University of Berlin, Berlin, 208, 2004Google Scholar
  64. 64.
    J.B. Rampal, DNA Arrays: Methods and Protocols (Humana Press, Totowa, 2001)CrossRefGoogle Scholar
  65. 65.
    S. Rash, D. Gusfield, String barcoding: uncovering optimal virus signatures, in Proceedings of the Sixth Annual International Conference on Computational Biology (ACM, New York, 2002), pp. 254–261Google Scholar
  66. 66.
    A. Relógio, C. Schwager, A. Richter, W. Ansorge, J. Valcárcel, Optimization of oligonucleotide-based DNA microarrays. Nucl. Acids Res. 30(11), e51 (2002)CrossRefGoogle Scholar
  67. 67.
    N. Reymond, H. Charles, L. Duret, F. Calevro, G. Beslon, J.M. Fayard, ROSO: optimizing oligonucleotide probes for microarrays. Bioinformatics 20(2), 271 (2004)CrossRefGoogle Scholar
  68. 68.
    S. Rimour, D. Hill, C. Militon, P. Peyret, GoArrays: highly dynamic and efficient microarray probe design. Bioinformatics 21(7), 1094 (2005)CrossRefGoogle Scholar
  69. 69.
    J.M. Rouillard, C.J. Herbert, M. Zuker, OligoArray: genome-scale oligonucleotide design for microarrays. Bioinformatics 18(3), 486–487 (2002)CrossRefGoogle Scholar
  70. 70.
    S. Rozen, H. Skaletsky, Primer3 on the WWW for general users and for biologist programmers. Methods Mol. Biol. 132(3), 365–386 (2000)Google Scholar
  71. 71.
    J. SantaLucia Jr., H.T. Allawi, P.A. Seneviratne, Improved Nearest-Neighbor Parameters for Predicting DNA Duplex Stability. Biochemistry 35(11), 3555–3562 (1996)CrossRefGoogle Scholar
  72. 72.
    M.P. Sawicki, G. Samara, M. Hurwitz, E. Passaro Jr., Human genome project. Am. J. Surg. 165(2), 258–264 (1993)CrossRefGoogle Scholar
  73. 73.
    A. Schliep, DC Torney, S. Rahmann, Group testing with dna chips: generating designs and decoding experiments. Proc. IEEE Comput. Soc. Bioinform. Conf. 2, 84–91 (2003)Google Scholar
  74. 74.
    C.E. Shannon, W. Weaver, The Mathematical Theory of Communication (Citeseer, 1959)Google Scholar
  75. 75.
    L. Soltan Ghoraie, R. Gras, L. Wang, A. Ngom, Bayesian optimization algorithm for the non-unique oligonucleotide probe selection problem. Pattern Recognit. Bioinform., 365–376 (2009)Google Scholar
  76. 76.
    W.K. Sung, W.H. Lee, Fast and accurate probe selection algorithm for large genomes, in Proceedings/IEEE Computer Society Bioinformatics Conference, Stanford, vol. 2, 2003, p. 65Google Scholar
  77. 77.
    M.T. Thai, T. Znati, On the complexity and approximation of non-unique probe selection using d-disjunct matrix. J. Comb. Optim. 17(1), 45–53 (2009)MathSciNetCrossRefMATHGoogle Scholar
  78. 78.
    N. Tolstrup, P.S. Nielsen, J.G. Kolberg, A.M. Frankel, H. Vissing, S. Kauppinen, OligoDesign: optimal design of LNA (locked nucleic acid) oligonucleotide capture probes for gene expression profiling. Nucl. Acids Res. 31(13), 3758 (2003)CrossRefGoogle Scholar
  79. 79.
    L. Wang, A. Ngom, A model-based approach to the non-unique oligonucleotide probe selection problem, in Second International Conference on Bio-Inspired Models of Network, Information, and Computing Systems, 2007. Bionetics 2007, Budapest (IEEE, 2007), pp. 209–215Google Scholar
  80. 80.
    L. Wang, A. Ngom, R. Gras, L. Rueda, An evolutionary approach to the non-unique oligonucleotide probe selection problem. Trans. Comput. Syst. Biol. X, 10, 143–162 (2008)CrossRefGoogle Scholar
  81. 81.
    L. Wang, A. Ngom, L. Rueda, Sequential forward selection approach to the non-unique oligonucleotide probe selection problem. Pattern Recognit. Bioinform., 262–275 (2008)Google Scholar
  82. 82.
    X. Wang, B. Seed, Selection of oligonucleotide probes for protein coding sequences. Bioinformatics 19(7), 796 (2003)CrossRefGoogle Scholar
  83. 83.
    J.D. Watson, F.H.C. Crick, Molecular structure of nucleic acids. Nature 171(4356), 737–738 (1953)CrossRefGoogle Scholar
  84. 84.
    R. Wernersson, A.S. Juncker, H.B. Nielsen, Probe selection for DNA microarrays using OligoWiz. Nat. Protoc. 2(11), 2677–2691 (2007)CrossRefGoogle Scholar
  85. 85.
    R. Wernersson, H.B. Nielsen, OligoWiz 2.0integrating sequence feature annotation into the design of microarray probes. Nucl. Acids Res. 33(suppl 2), W611 (2005)CrossRefGoogle Scholar
  86. 86.
    D. Xu, Y. Xu, G. Li, J. Zhou, A computer program for generating gene-specific fragments for microarrays, in Currents in Computational Molecular Biology (Universal Academy Press, Tokyo, 2000), pp. 3–4Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Elisa Pappalardo
    • 1
  • Beyza Ahlatcioglu Ozkok
    • 2
  • Panos M. Pardalos
    • 3
  1. 1.Dipartmento di Matematica e InformaticaUniversita di CataniaCataniaItaly
  2. 2.Department of Mathematics, Faculty of Arts and ScienceYildiz Technical UniversityIstanbulTurkey
  3. 3.Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations