



- Công bố khoa học và công nghệ Việt Nam
Võ Trí Nam , Lê Đăng Lộc , Huỳnh Quốc Việt , Trần Linh Thước(1) , Nguyễn Đức Hoàng
Xây dựng chương trình tối ưu hóa gene dựa trên thuật giải tối ưu đàn kiến cho Escherichia coli
Constructing a gene optimization program based on the ant colony optimization algorithm for Escherichia coli
Tạp chí Phát triển Khoa học & Công nghệ: Chuyên san Khoa học Tự nhiên
2018
2
In recombinant protein production, transferring a wild type gene of one organism into another expression host sometime resulted in a low gene expression due to incompatibility between the gene and the expression system. In that case, the target gene needed to be optimized to be more compatible with the expression system through gene optimization process in which nucleotide composition of original gene would be replaced by synonym codons while retaining the protein sequence. In existing gene optimization programs, many optimization algorithms have been applied, such as Genetic Algorithm or Sliding Window, to search for the optimized gene sequence. In this research, we applied the Ant Colony Optimization (ACO) algorithm to construct a gene optimization program. The results showed that the gene after optimization has been improved in codon usage, GC content and reduced the occurrence of factors reducing transcription and translation efficiencies such as polycodon, polynucleotide, repeated sequence, and Shine - Dalgarno sequence. Comparing with some current programs using a gene encoding for human insulin also proved the efficiency in the gene optimization this program. These results have demonstrated the capabilities of applying ACO algorithm in the gene optimization problem
In recombinant protein production, transferring a wild type gene of one organism into another expression host sometime resulted in a low gene expression due to incompatibility between the gene and the expression system. In that case, the target gene needed to be optimized to be more compatible with the expression system through gene optimization process in which nucleotide composition of original gene would be replaced by synonym codons while retaining the protein sequence. In existing gene optimization programs, many optimization algorithms have been applied, such as Genetic Algorithm or Sliding Window, to search for the optimized gene sequence. In this research, we applied the Ant Colony Optimization (ACO) algorithm to construct a gene optimization program. The results showed that the gene after optimization has been improved in codon usage, GC content and reduced the occurrence of factors reducing transcription and translation efficiencies such as polycodon, polynucleotide, repeated sequence, and Shine - Dalgarno sequence. Comparing with some current programs using a gene encoding for human insulin also proved the efficiency in the gene optimization this program. These results have demonstrated the capabilities of applying ACO algorithm in the gene optimization problem
- [1] D.J. Rosenkrantz, R.E. Stearns, P.M. Lewis (1977), An analysis of several heuristics for the traveling salesman problem,SIAM Journal on Computing
- [2] D. Raab, M. Graf, F. Notka, T. Schödl, R. Wagner (2010), The GeneOptimizer Algorithm,Systems and Synthetic Biology
- [3] V. Phan, S. Saha, A. Pandey, T.Y. Wong (2010), Synthetic gene design with a large number of hidden stops,International Journal of Data Mining and Bioinformatics
- [4] R.B. Pandhi (2007), VLSI Circuit Partitioning using Ants Colony Optimization,PhD Dissertation, Computer Science & Engineering Department
- [5] S. Lee, S. Weon, S. Lee, C. Kang (2010), Relative codon adaptation index, a sensitive measure of codon usage bias,Evolutionary Bioinformatics
- [6] H.T. Le, N.T. Vo, T. Huynh, H.D. Nguyen (2015), Analyzing characteristics of Highly Expressed Genes (HEG) of Escherichia coli K12,Genomic Medicine
- [7] J.H. Holland (1975), Adaptation in natural and artificial systems,U Michigan Press
- [8] M. Dorigo, L.M. Gambardella (1997), Ant colony system: a cooperative learning approach to the traveling salesman problem,IEEE Transactions on evolutionary computation
- [9] M. Dorigo (1992), Optimization, learning and natural algorithms,Ph.D. Thesis, Politecnico di Milano
- [10] G.M. Cannarozzi, A. Schneider (2012), Codon evolution: mechanisms and models,Oxford University Press
- [11] D.J. Rosenkrantz, R.E. Stearns, P.M. Lewis (1977), An analysis of several heuristics for the traveling salesman problem,SIAM Journal on Computing, vol. 6, pp. 563– 581
- [12] D. Raab, M. Graf, F. Notka, T. Schödl, R. Wagner (2010), The GeneOptimizer Algorithm: using a sliding window approach to cope with the vast sequence space in multiparameter DNA sequence optimization,Systems and Synthetic Biology, vol. 4, pp. 215–225
- [13] V. Phan, S. Saha, A. Pandey, T.Y. Wong (2010), Synthetic gene design with a large number of hidden stops,International Journal of Data Mining and Bioinformatics, vol. 4, pp. 377–394
- [14] R.B. Pandhi (), VLSI Circuit Partitioning using Ants Colony Optimization, PhD dissertation, Computer Science & Engineering Department, Thapar University,
- [15] S. Lee, S. Weon, S. Lee, C. Kang (2010), Relative codon adaptation index, a sensitive measure of codon usage bias,Evolutionary Bioinformatics, vol. 6, no. 47
- [16] H.T. Le, N.T. Vo, T. Huynh, H.D. Nguyen (2015), Analyzing c-haracteristics of Highly Expressed Genes (HEG) of Escherichia coli K12,Genomic Medicine
- [17] J.H. Holland (1975), Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence,
- [18] ]M. Dorigo, L.M. Gambardella (1997), Ant colony system: a cooperative learning approach to the traveling salesman problem,IEEE Transactions on evolutionary computation, vol. 1, pp. 53–66
- [19] M. Dorigo (1992), Optimization, learning and natural algorithms,Ph. D. Thesis, Politecnico di Milano, Italy
- [20] G.M. Cannarozzi, A. Schneide (2012), Codon evolution: mechanisms and models,