loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE Computer Society Bioinformatics Conference (CSB'03)
A Pattern Matching Algorithm for Codon Optimization and CpG Motif-Engineering in DNA Expression Vectors
Stanford, California
August 11-August 14
ISBN: 0-7695-2000-6
Ravi Vijaya Satya, University of Central Florida
Amar Mukherjee, University of Central Florida
Udaykumar Ranga, Jawaharlal Nehru Center for Advanced Scientific Research
Codon optimization enhances the efficiency of DNA expression vectors used in DNA vaccination and gene therapy by increasing protein expression. Additionally, certain nucleotide motifs have experimentally been shown to be immuno-stimulatory while certain others immuno-suppressive. In this paper, we present algorithms to locate a given set of immuno-modulatory motifs in the DNA expression vectors corresponding to a given amino acid sequence and maximize or minimize the number and the context of the immuno-modulatory motifs in the DNA expression vectors. The main contribution is to use multiple pattern matching algorithms to synthesize a DNA sequence for a given amino acid sequence and a graph theoretic approach for finding the longest weighted path in a directed graph that will maximize or minimize certain motifs. This is achieved using O(n2) time, where n is the length of the amino acid sequence. Based on this, we develop a software tool.
Index Terms:
Codon optimization, immuno-modulatory motifs, multiple pattern matching, longest weighted path
Citation:
Ravi Vijaya Satya, Amar Mukherjee, Udaykumar Ranga, "A Pattern Matching Algorithm for Codon Optimization and CpG Motif-Engineering in DNA Expression Vectors," csb, pp.294, IEEE Computer Society Bioinformatics Conference (CSB'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.