| Literature DB >> 17439967 |
Pere Puigbò1, Eduard Guzmán, Antoni Romeu, Santiago Garcia-Vallvé.
Abstract
OPTIMIZER is an on-line application that optimizes the codon usage of a gene to increase its expression level. Three methods of optimization are available: the 'one amino acid-one codon' method, a guided random method based on a Monte Carlo algorithm, and a new method designed to maximize the optimization with the fewest changes in the query sequence. One of the main features of OPTIMIZER is that it makes it possible to optimize a DNA sequence using pre-computed codon usage tables from a predicted group of highly expressed genes from more than 150 prokaryotic species under strong translational selection. These groups of highly expressed genes have been predicted using a new iterative algorithm. In addition, users can use, as a reference set, a pre-computed table containing the mean codon usage of ribosomal protein genes and, as a novelty, the tRNA gene-copy numbers. OPTIMIZER is accessible free of charge at http://genomes.urv.es/OPTIMIZER.Entities:
Mesh:
Substances:
Year: 2007 PMID: 17439967 PMCID: PMC1933141 DOI: 10.1093/nar/gkm219
Source DB: PubMed Journal: Nucleic Acids Res ISSN: 0305-1048 Impact factor: 16.971
Figure 1.Outputs provided from the optimization of a DNA sequence: (a) the optimized and query sequences and the indices (CAI, ENc and%G + C) for evaluating the optimization process, (b) codon usage tables of the query and optimized sequences, (c) query and optimized sequence alignment to show changes in nucleotides (transitions or transversions) and (d) graphical view of the codon weight chart.
Comparison of OPTIMIZER with other similar freely available web servers and softwares
| Name | Methods | Genetic code | Reference set | Reference |
|---|---|---|---|---|
| Web servers | ||||
| – One amino acid–one codon | Multiple | – HEG from >150 bacterial genomes under TS | This article | |
| – Guided Random (Monte Carlo algorithm)b | – RPG | |||
| – Customized one amino acid–one codon | – tGCN | |||
| – Codon usage database | ||||
| – Defined by users | ||||
| JCAT | – One amino acid–one codon | Standard | – HEG from >200 bacterial genomes | 28 |
| – Defined by users | ||||
| Synthetic Gene Designer (SGD) | – One amino acid–one codona | Multiple | – HEG from six bacterial genomes | 24 |
| – Selective optimizationa | – Codon usage database | |||
| – Probabilistic optimizationa,b | – Defined by users | |||
| DNAWorks | – Use of the two highest frequency codons | Standard | – HEG from | 25 |
| – Random | – Codon usage tables for 10 species | |||
| – Codon usage database | ||||
| – Defined by users | ||||
| GeneDesign | – One amino acid–one codon | Standard | – HEG from four species | 23 |
| – The next most optimal algorithm | – Defined by users | |||
| – The most different algorithm | ||||
| – Random | ||||
| Stand-alone applications | ||||
| Gene Designer | – One amino acid–one codon | Standard | – HEG from | 18 |
| – Monte Carlo algorithmb | – Codon usage tables for 25 species | |||
| – Codon usage database | ||||
| – Defined by users | ||||
| Codon optimizer | – One amino acid–one codon | Standard | – HEG for several bacterial species | 29 |
| – Defined by users | ||||
| INCA 2.1 | – One amino acid–one codon | Multiple | – Mean codon usage of a whole genome or selection of any group of genes | 27 |
| UPGene | – One amino acid–one codon | Standard | – Eukaryotic, bacteria, yeast, plant and worm predefined codon usage frequency tables | 30 |
| – Defined by users | ||||
| GeMS | – Monte Carlo algorithmb | Standard | – Codon usage database | 26 |
| – Defined by users |
Abbreviations used: HEG, codon usage of predicted highly expressed genes; RPG, codon usage of ribosomal protein genes; tGCN, tRNA gene-copy number; TS, translational selection.
aIt uses an ‘optimality factor,’ defined as a scaling factor, to control the optimality of codon usage. Higher values of this factor mean low CAI values and less optimized and more random codon usage.
bThese methods are essentially the same. They use the relative codon usage frequencies of the reference set as the relative probability that each codon will be used in the optimization process.