Evolutionary Algorithm - that Designs the DNA Synthesis Procedure

Maciej Michalak , Robert Marek Nowak


Chemical synthesis of nucleotide chains is very er- roneous for long sequences. Often a gene is constructed from short fragments joined with the use of complementary helper chains. The number of possible potential solutions for a long gene synthesis is very large, therefore a fast automated search is required. In the presented approach a modified method of long DNA construction is proposed. A computer program that searches for an optimal solution in the space of poten- tial synthesis methods has been developed. This software uses an evolutionary algorithm for global optimization and a hill- climbing algorithm for local optimization. The long DNA con- struction method was tested on random sequences. The results are very promising. The next step is to perform experiments in a biotechnological wet laboratory involving DNA strand syn- thesis using the method designed by the presented software.
Author Maciej Michalak (FEIT)
Maciej Michalak,,
- Faculty of Electronics and Information Technology
, Robert Marek Nowak (FEIT / PE)
Robert Marek Nowak,,
- The Institute of Electronic Systems
Journal seriesJournal of Telecommunications and Information Technology, (B 7 pkt)
Issue year2011
Keywords in Englishbioinformatics, gene synthesis, optimum searching
ASJC Classification2208 Electrical and Electronic Engineering; 1705 Computer Networks and Communications
ProjectResearch on measurment, circuit and signal theory and electronic circuits and systems. Project leader: Romaniuk Ryszard, , Phone: +48 22 234 7986, +48 22 234 5360, start date 05-04-2012, planned end date 31-12-2012, end date 30-11-2013, ISE/2012/DS, Completed
WEiTI Działalność statutowa
Languageen angielski
Score (nominal)7
Score sourcejournalList
Publication indicators Scopus SNIP (Source Normalised Impact per Paper): 2013 = 0.507
Citation count*
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?