A Pattern Matching Algorithm For Codon Optimization And Cpg Motif-Engineering In Dna Expression Vectors


Codon optimization; immuno-modulatory motifs; longest weighted path; multiple pattern matching


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.

Publication Date


Publication Title

Proceedings of the 2003 IEEE Bioinformatics Conference, CSB 2003

Number of Pages


Document Type

Article; Proceedings Paper

Personal Identifier


DOI Link


Socpus ID

84960366641 (Scopus)

Source API URL


This document is currently not available here.