A Multi-objective Genetic Algorithm Based Approach to the Optimization of Oligonucleotide Microarray Production Process

  • Filippo Menolascina
  • Vitoantonio Bevilacqua
  • Caterina Ciminelli
  • Mario Nicola Armenise
  • Giuseppe Mastronardi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5227)


Microarrays are becoming more and more utilized in the experimental platform in molecular biology. Although rapidly becoming affordable, these micro devices still have quite high production cost which limits their commercial appeal. Here we present a novel multiobjective evolutionary approach to the optimization of the production process of microarray devices mainly aimed at lowering the number of fabrication steps. In order to allow the reader to better understand what we describe we report herein a detailed description of a real-world study case carried out on the most recent microarray platforms of the market leader in this field. A comparative analysis of the most widely used approaches, main potentialities and drawbacks of the proposed approach are presented.


Pareto Front Deposition Sequence Microelectrode Array Microarray Production Photolithographic Mask 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Fodor, S., Read, J., Pirrung, M., Stryer, L., Lu, A., Solas, D.: Light-directed, Spatially Addressable Parallel Chemical Synthesis. Science 251, 767–773 (1991)CrossRefGoogle Scholar
  2. 2.
    Hannenhalli, S., Hubell, E., Lipshutz, R., Pevzner, P.A.: Combinatorial Algorithms for Design of DNA Arrays. Advances in Biochemical Engineering Biotechnology 77, 1–9 (2002)Google Scholar
  3. 3.
    Storer, J.A.: Data Compression: Methods and Theory. Computer Science Press (1988)Google Scholar
  4. 4.
    Foulser, D.E., Li, M., Yang, Q.: Theory and Algorithms for Plan Merging. Artificial Intelligence 57(2), 143–181 (1992)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Sellis, T.K.: Multiple-query Optimization. ACM Transactions on Database Systems (TODS) 13(1), 23–52 (1988)CrossRefGoogle Scholar
  6. 6.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press/McGraw-Hill (2001)Google Scholar
  7. 7.
    Sankoff, D., Kruskal, J.: Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparisons. Addison Wesley, Reading (1983)Google Scholar
  8. 8.
    Barone, P., Bonizzoni, P., Vedova, G.D., Mauri, G.: An Approximation Algorithm for the Shortest Common Supersequence Problem: an Experimental Analysis. In: Symposium on Applied Computing, Proceedings of the 2001 ACM symposium on Applied computing, pp. 56–60 (2001)Google Scholar
  9. 9.
    Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)MATHGoogle Scholar
  10. 10.
    Jiang, T., Li, M.: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. SIAM Journal of Computing 24(5), 1122–1139 (1995)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Timkovsky, V.G.: On the Approximation of Shortest Common Non-subsequences and Supersequences. Technical report (1993)Google Scholar
  12. 12.
    Kasif, S., Weng, Z., Derti, A., Beigel, R., DeLisi, C.: A Computational Framework for Optimal Masking in the Synthesis of Oligonucleotide Microarrays. Nucleic Acids Research 30(20) (2002)Google Scholar
  13. 13.
    Irving, R.W., Fraser, C.: On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings. In: Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, pp. 63–73 (1993)Google Scholar
  14. 14.
    Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
  15. 15.
    Jones, D.F., Mirrazavi, S.K., Tamiz, M.: Multiobjective Meta-heuristics: An Overview of the Current State-of-the-art. Eur. J. Oper. Res. 137(1), 1 (2002)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Filippo Menolascina
    • 1
  • Vitoantonio Bevilacqua
    • 1
  • Caterina Ciminelli
    • 1
  • Mario Nicola Armenise
    • 1
  • Giuseppe Mastronardi
    • 1
  1. 1.Department of Electrotechnics and Electronics Technical University of BariItaly

Personalised recommendations