序列組合問題在人類基因計畫中的ＤＮＡ定序方面，扮演一個很重要的角色。在本論文裡，我們應用遺傳演算法來解序列組合問題。在研究的過程中，我們根據問題的特性來設計染色體的表示方式、演化和突變的運算子來解序列組合問題。最後我們也將我們的方法和其他相關的方法作一比較。

Fragment assembly plays an important role in DNA sequences of Human Genome Project. In this thesis, we apply genetic algorithms to solve fragment assembly. The proposed approach is based on the problem’s characteristics to design crossover and mutation operators. We also compare our approach with other works in the literature.

Chapter 6 References
[1]Carlsson, P., Darnfors, C., Olofsson, S.-O. and Bjursell G.. (1986) Analysis of the human apolipoprotein B gene; complete structure of the B-74 region. Gene 49: 29-51
[2]Eagle M.L. and Burks C. (1993) Artificial Generated Data Sets for Testing DNA Sequence Assembly Algorithms Genomics 16:186-288
[3]Gallant J., Maier D., and Storer J. (1980) On finding minimum length superstrings. J. Comp. Systems Sci. 20:50-58
[4]Goldberg D.E. (1989) Genetic algorithm in search, optimization, and machine learning. Addison-Wesley Publishing Company, Inc.
[5]Huang, X. (1992). A Contig Assembly Program Based on Sensitive Detection of Fragment Overlaps. Genomics 14:18-25
[6]Huang, X. (1996). An Improved Sequence Assembly Program. Genomics 33:21-31
[7]Huang, X and Madan, A (1999) CAP3: A DNA Sequence Assembly Problem. Genome Research 9:868-877
[8]Jong, k. De (1988). Learning with genetic algorithms: An overview. In Machine Learning 3,121-138.Hingham, MA: Kluwer
[9]Larson, S. ,Jain, M., Anson, E., and Myers, G., (1996) An Interface for a Fragment Assembly Kernel. Technical Report 96-04, Dept. of computer Science, The University of Arizona,Tucson,85721
[10] Lin,X., et al.,(1999) Sequence and analysis of chromosome 2 of the plant Arabidopsis thaliana Nature 402 (6763), 761-768
[11]Matsumoto, K.I., Arai M., Ishihara, N., Ando, A., Inoko, H., and Ikemura, T. (1992) Cluster of fibronectin type-III repeats found in the human major histocompatibility complex class III region shows highest homology with repeats in tenascin. Genomics 12: 485-491
[12]Needleman, S. B. and Wunsch, C. D. (1970) Ageneral method cpplicable to the search for similarities in the amino acid sequences of two proteins. Journal of Molecular Biology. 42: 161-245
[13]Pal, Sankar K. ,Wang,Paul P. (1996). Genetic algorithm for pattern recognition. Boca Raton: CRC Press.
[14]Parsons, R. J., Forrest, S. and Burks, C. (1995). Genetic Algorithms, operators, and DNA Fragment Assembly. Machine Learning 21 (1-2): 11-33 (1995)
[15]Sanger, F, ;Coulson, A,;Hill,D.; and Petersen,G. 1982 Nucleotide sequence of bacteriophage lambda DNA. J. MOL. Biol.162:729-773
[16]Setubal, J. and Meidanis, J. (1997). Introduction to Computational Molecular Biology, PWS publishing Company
[17] Sverdlov, E. D et al., (1987) Family of human Na+, K+-ATPase genes. Structure of the gene of isoform alpha-III. Dokl. Biochem. 297, 426-431
[18]Tao, G. and Michalewicz, Z. Inver-over Operator for the TSP, Proceedings of the 5th Parallel Problem Solving from Nature, T. Baeck, A.E. Eiben, M. Schoenauer, and H.-P. Schwefel (Editors), Amsterdam, September 27-30, 1998, Springer-Verlag, Lecture Notes in Computer Science, pp.803-812.
[19]Whitely, Darrell (1994). A Genetic Algorithm Tutorial. Statistics and Computing. 4:65-85.