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

DOI: 10.1007/978-3-540-85984-0_125

关键词:

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

参考文章(16)
Sridhar Hannenhalli, Earl Hubbell, Robert Lipshutz, Pavel A. Pevzner, Combinatorial algorithms for design of DNA arrays. Advances in Biochemical Engineering \/ Biotechnology. ,vol. 77, pp. 1- 19 ,(2002) , 10.1007/3-540-45713-5_1
TH Cormen, RL Rivest, CE Leiserson, C Stein, Introduction to Algorithms, 2nd edition. ,(2001)
James A. Storer, Data compression: methods and theory Computer Science Press, Inc.. ,(1987)
Robert W. Irving, Campbell B. Fraser, On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings combinatorial pattern matching. pp. 63- 73 ,(1993) , 10.1007/BFB0029797
D.F Jones, S.K Mirrazavi, M Tamiz, Multi-objective meta-heuristics: An overview of the current state-of-the-art European Journal of Operational Research. ,vol. 137, pp. 1- 9 ,(2002) , 10.1016/S0377-2217(01)00123-0
Tao Jiang, Ming Li, On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences SIAM Journal on Computing. ,vol. 24, pp. 1122- 1139 ,(1995) , 10.1137/S009753979223842X