By Topic

Genetic algorithm approach for the closest string problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mauch, H. ; Dept. of Inf. & Comput. Sci., Hawaii Univ., Honolulu, HI, USA ; Melzer, M.J. ; Hu, J.S.

A fundamental aspect of post-transcriptional gene silencing (PTGS) or RNA interference (RNAi) is the requirement of sequence homology between the transgene and viral or messenger RNAs being targeted. For example, virus-resistant transgenic plants are resistant only to viruses that are closely related (i.e. high sequence homology) to the virus from which the transgene was derived. One idea for broadening this resistance is to devise an artificial sequence that incorporates the sequence variation found in a viral population. This requires an algorithm which can determine an artificial sequence with an optimal (or at least a 90-95% ) homology to all of the viral sequences in a population. The genetic algorithm (GA) presented in this paper serves this purpose. It should be of great value to all researchers who utilize PTGS or RNAi. In the context of coding theory, the task is to find the radius of a code S ⊂ {A, C, G, T} n. In computational biology this problem is commonly referred to as the closest string problem. Experimental results suggest that this NP-complete optimization problem can be approached well with a custom-built GA.

Published in:

Bioinformatics Conference, 2003. CSB 2003. Proceedings of the 2003 IEEE

Date of Conference:

11-14 Aug. 2003