論文使用權限 Thesis access permission:校內外都一年後公開 withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available
論文名稱 Title |
運用基因演算法達成生物晶片之最佳品管控制 Optimal Quality Control for Oligo-arrays Using Genetic Algorithm |
||
系所名稱 Department |
|||
畢業學年期 Year, semester |
語文別 Language |
||
學位類別 Degree |
頁數 Number of pages |
34 |
|
研究生 Author |
|||
指導教授 Advisor |
|||
召集委員 Convenor |
|||
口試委員 Advisory Committee |
|||
口試日期 Date of Exam |
2004-06-18 |
繳交日期 Date of Submission |
2004-08-17 |
關鍵字 Keywords |
基因演算法、生物晶片、品管控制 oligo array, quality control, genetic algorithm |
||
統計 Statistics |
本論文已被瀏覽 5718 次,被下載 2367 次 The thesis/dissertation has been browsed 5718 times, has been downloaded 2367 times. |
中文摘要 |
Oligo array是一種將基因表現量化及大量平行化測量的高產量技術,目前廣泛地運用在生物與醫學方面的研究。在其製造過程之中,若合成的程序執行時產生一個錯誤的步驟,將會影響到所有使用該錯誤步驟的探針。在此論文中,我們採用了兩階段基因演算法來達成oligo array的最佳品管控制,藉此來偵測任何一個單一錯誤的步驟。第一個階段執行廣泛的搜尋以獲得近似解,第二個階段對這些近似解的區域進行細微的搜尋以獲得最佳解。而且,我們所提出的演算法可利用多個個體同時搜尋多個空間。兩階段基因演算法優越的搜尋能力幫助我們找到hill-climbing演算法可以找到的275例子。除此之外,也找到了5種利用hill-climbing演算法無法解決的例子。 |
Abstract |
Oligo array is a high throughput technology and is widely used in many scopes of biology and medical researches for quantitative and highly parallel measurements of gene expression. When one faulty step occurs during the synthesis process, it affects all probes using the faulty step. In this thesis, a two-phase genetic algorithm (GA) is proposed to design optimal quality control of oligo array for detecting any single faulty step. The first phase performs the wide search to obtain the approximate solutions and the second phase performs the local search on the approximate solutions to achieve the optimal solution. Besides, the proposed algorithm could hold many non-duplicate individuals and parallelly search multiple regions simultaneously. The superior searching capability of the two-phase GA helps us to find out the 275 nonequireplicate cases that settled by the hill-climbing algorithm. Furthermore, the proposed algorithm also discovers five more open issues. |
目次 Table of Contents |
Chapter 1. INTRODUCTION 1 Chapter 2. BACKGROUND MATERIALS 4 2.1 OLIGO ARRAYS 4 2.2 BALANCED BINARY CODES 6 2.3 GENETIC ALGORITHM 8 2.4 LITERATURE REVIEWS 9 Chapter 3. THE PROPOSED ALGORITHM 15 3.1 ENCODING AND DECODING 17 3.2 INITIAL POPULATION 18 3.3 EVALUATION 18 3.4 GA OPERATORS 21 3.4.1 Selection 21 3.4.2 Crossover 21 3.4.3 Mutation 22 Chapter 4. IMPLEMENTATION RESULTS 25 Chapter 5. DISCUSSION 28 Chapter 6. CONCLUSIONS 32 REFERENCES 33 |
參考文獻 References |
[1] G. Gibson and S. V. Muse (2002), A primer of genome science. Sinauer Associates, Inc.pp.123-181. [2] M. Chee, R. Yang, E. Hubbell, A. Berno, X.C. Huang, D.Stern, J. Winkler, D. J. Lockhart, M. S. Morris and S. P. Fodor (1996), Accessing genetic information with high-density DNA arrays. Science, Vol. 274, pp.610-614. [3] R. J. Lipshutz, S. P. A. Fodor, T. R. Gingeras and D. J. Lockhart (1999), High density synthetic oligonucleotide arrays, Nature Genetics Supplement, Vol. 21, pp. 20-24. [4] E. Hubbell and P. A. Pevzner (1999), Fidelity probes for DNA arrays, in Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, AAAI Press, Heidelberg, Germany, pp. 113-117. [5] R. Sengupta and M. Tompa (2002), Quality control in manufacturing oligo arrays: A combinatorial design approach, Journal of Computational Biology, Vol. 9, pp. 1-22. [6] N. Alon, C. J. Colbourn, A. C. H. Ling and M. Tompa (2001), Equireplicate balanced binary codes for oligo arrays, SIAM J. Discrete Math, Vol. 14, pp. 481-497. [7] C. J. Colbourn, A. C. H. Ling and M. Tompa (2002), Construction of optimal quality control for oligo arrays, Bioinformatics, Vol. 18, pp. 529-535. [8] D. E. Goldberg (1989), Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley , New York . [9] L. Davis (1989), Handbook of Genetic Algorithm, Van Nostrand Reynold. [10] M. Yamamura, S. Kobayashi, M. Yamagishi and H. Ase (1993), Nurse Scheduling by Genetic Algorithms, Hiroaki Kitano: Genetic Algorithms, Vol. 2, pp. 89-125. [11] T. Inoue, T. Furuhashi, M. Fujii, H. Maeda and M. Takaba (1999): Development of Nurse Scheduling Support System Using Interactive EA, SMC99, pp. 533-537. [12] T. M. Mitchell (1997), Machine Learning. McGraw-Hill, New York, USA. pp. 249-273. [13] Affymetrix Inc. , Array manufacturing , http://www.affymetrix.com/technology/manufacturing/index.affx [14] S. Singh-Gasson, R. D. Green, Y. Yue, C. Nelson, F.Blattner, M. R. Sussman and F. Cerrina, (1999) Maskless fabrication of lightdirected oligonucleotide microarrays using a digital micromirror array. Nat. Biotechnol., Vol. 17, pp. 974-978. [15] J. H. Holland, (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press. [16] J. H. Chen, S. Y. Le and J.V. Maizel (2000), Prediction of common secondary structures of RNAs:a genetic algorithm approach. Nucleic Acids Research, Vol.28, No.4, pp.991-999. [17] J. S. Wu, C. N. Lee, C. C. Wu and Y. L. Shiue (2003), Primer Design Using Genetic Algorithm, Bioinformatics, Advance Access published on February 26, 2004. [18] D. P. Shaver, (1973) Construction of (v , k ,λ)-designs using a non-enumerative search technique, PhD Thesis, Syracuse University. |
電子全文 Fulltext |
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。 論文使用權限 Thesis access permission:校內外都一年後公開 withheld 開放時間 Available: 校內 Campus: 已公開 available 校外 Off-campus: 已公開 available |
紙本論文 Printed copies |
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。 開放時間 available 已公開 available |
QR Code |