Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fodor, S., Read, J., Pirrung, M., Stryer, L., Lu, A., Solas, D.: Light-directed, Spatially Addressable Parallel Chemical Synthesis. Science 251, 767–773 (1991)
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)
Storer, J.A.: Data Compression: Methods and Theory. Computer Science Press (1988)
Foulser, D.E., Li, M., Yang, Q.: Theory and Algorithms for Plan Merging. Artificial Intelligence 57(2), 143–181 (1992)
Sellis, T.K.: Multiple-query Optimization. ACM Transactions on Database Systems (TODS) 13(1), 23–52 (1988)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press/McGraw-Hill (2001)
Sankoff, D., Kruskal, J.: Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparisons. Addison Wesley, Reading (1983)
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)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)
Jiang, T., Li, M.: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. SIAM Journal of Computing 24(5), 1122–1139 (1995)
Timkovsky, V.G.: On the Approximation of Shortest Common Non-subsequences and Supersequences. Technical report (1993)
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)
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)
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Menolascina, F., Bevilacqua, V., Ciminelli, C., Armenise, M.N., Mastronardi, G. (2008). A Multi-objective Genetic Algorithm Based Approach to the Optimization of Oligonucleotide Microarray Production Process. In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2008. Lecture Notes in Computer Science(), vol 5227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85984-0_125
Download citation
DOI: https://doi.org/10.1007/978-3-540-85984-0_125
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85983-3
Online ISBN: 978-3-540-85984-0
eBook Packages: Computer ScienceComputer Science (R0)