Optimal codon randomization via mathematical programming

Journal of Theoretical Biology

Volumn 335, Issue , 2013, Pages 147-152

  Nov, Yuval ^a   Segev, Danny ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Codon randomization; Degenerate oligonucleotides; Integer programming; Protein engineering; Spiked oligonucleotides

Indexed keywords

AMINO ACID; DEGENERATE OLIGONUCLEOTIDE; OLIGONUCLEOTIDE; SPIKED OLIGONUCLEOTIDE; UNCLASSIFIED DRUG;

AMINO ACID; DNA; GENETIC ENGINEERING; GENETICS; OPTIMIZATION; PROTEIN; RNA;

ARTICLE; CODON; CODON RANDOMIZATION; CONTROLLED STUDY; MATHEMATICAL MODEL; MATHEMATICAL PROGRAMMING; PRIORITY JOURNAL; PROBABILITY; PROTEIN ENGINEERING; RANDOMIZATION;

CODON RANDOMIZATION; DEGENERATE OLIGONUCLEOTIDES; INTEGER PROGRAMMING; PROTEIN ENGINEERING; SPIKED OLIGONUCLEOTIDES;

CODON; MODELS, GENETIC; OLIGONUCLEOTIDES; SOFTWARE;

EID: 84880635582     PISSN: 00225193     EISSN: 10958541     Source Type: Journal    
DOI: 10.1016/j.jtbi.2013.05.034     Document Type: Article

References (27)

1. Arkin A., Youvan D. Optimizing nucleotide mixtures to encode specific subsets of amino acids for semi-random mutagenesis. Nat. Biotechnol. 1992, 10(3):297-300.
2. Bellows M., Floudas C. Computational methods for de novo protein design and its applications to the human immunodeficiency virus 1, purine nucleoside phosphorylase ubiquitin specific protease 7, and histone demethylases. Curr. Drug Targets 2010, 11(3):264.
3. Bertsimas D., Weismantel R. Optimization Over Integers 2005, Dynamic Ideas, Belmont, MA.
4. L. J. Mol. Biol. 2013, 425:171-185.
5. Cornish-Bowden A. Nomenclature for incompletely specified bases in nucleic acid sequences. recommendations 1984. Nucleic Acids Res. 1985, 13(9):3021-3030.
6. Fellouse F., Wiesmann C., Sidhu S. Synthetic antibodies from a four-amino-acid code. a dominant role for tyrosine in antigen recognition. Proc. Natl. Acad. Sci. USA 2004, 101(34):12467-12472.
7. Firth A.E., Patrick W.M. GLUE-IT and PEDEL-AA. new programmes for analyzing protein diversity in randomized libraries. Nucleic Acids Res. 2008, 36(Suppl. 2):W281-W285.
8. Fourer R., Gay D.M., Kernighan B.W. AMPL. A Modeling Language for Mathematical Programming 2003, Duxbury Press/Brooks/Cole Publishing Company.
9. Gilbreth R., Esaki K., Koide A., Sidhu S., Koide S. A dominant conformational role for amino acid diversity in minimalist protein-protein interfaces. J. Mol. Biol. 2008, 381(2):407-418.
10. Hokanson C., Cappuccilli G., Odineca T., Bozic M., Behnke C., Mendez M., Coleman W., Crea R. Engineering highly thermostable xylanase variants using an enhanced combinatorial library method. Protein Eng. Des. Sel. 2011, 24(8):597-605.
11. Jensen L., Andersen K., Svendsen A., Kretzschmar T. Scoring functions for computational algorithms applicable to the design of spiked oligonucleotides. Nucleic Acids Res. 1998, 26(3):697-702.
12. Kille S., Acevedo-Rocha C., Parra L., Zhang Z., Opperman D., Reetz M., Acevedo J. Reducing codon redundancy and screening effort of combinatorial protein libraries created by saturation mutagenesis. ACS Synth. Biol. 2013.
13. Mena M., Daugherty P. Automated design of degenerate codon libraries. Protein Eng. Des. Sel. 2005, 18(12):559-561.
14. Neylon C. Chemical and biochemical strategies for the randomization of protein encoding DNA sequences. library construction methods for directed evolution. Nucleic Acids Res. 2004, 32(4):1448-1459.
15. Ophir R., Gershoni J. Biased random mutagenesis of peptides. determination of mutation frequency by computer simulation. Protein Eng. 1995, 8(2):143-146.
16. Parker A., Griswold K., Bailey-Kellogg C. Optimization of combinatorial mutagenesis. J. Comput. Biol. 2011, 18(11):1743-1756.
17. Patrick W.M., Firth A.E. Strategies and computational tools for improving randomized protein libraries. Biomol. Eng. 2005, 22(4):105-112.
18. Reetz M., Kahakeaw D., Lohmer R. Addressing the numbers problem in directed evolution. ChemBioChem 2008, 9(11):1797-1804.
19. Saraf M., Gupta A., Maranas C. Design of combinatorial protein libraries of optimal size. Proteins. Struct. Funct. Bioinformatics 2005, 60(4):769-777.
20. Saraf M., Moore G., Goodey N., Cao V., Benkovic S., Maranas C. Ipro. an iterative computational protein library redesign and optimization procedure. Biophys. J. 2006, 90(11):4167-4180.
21. Schrijver A. Theory of Linear and Integer Programming 1998, John Wiley and Sons.
22. Siderovski D., Mak T. Ramha. a PC-based Monte-Carlo simulation of random saturation mutagenesis. Comput. Biol. Med. 1993, 23(6):463-474.
23. Tanaka J., Doi N., Takashima H., Yanagawa H. Comparative characterization of random-sequence proteins consisting of 5, 12, and 20 kinds of amino acids. Protein Sci. 2010, 19(4):786-795.
24. Tang L., Gao H., Zhu X., Wang X., Zhou M., Jiang R. Construction of "small-intelligent" focused mutagenesis libraries using well-designed combinatorial degenerate primers. BioTechniques 2012, 52:149-158.
25. Tomandl D., Schober A., Schwienhorst A. Optimizing doped libraries by using genetic algorithms. J. Comput.-Aided Mol. Des. 1997, 11(1):29-38.
26. Wolf E., Kim P. Combinatorial codons. a computer program to approximate amino acid probabilities with biased nucleotide usage. Protein Sci. 1999, 8(3):680-688.
27. Wolsey L.A., Nemhauser G.L. Integer and Combinatorial Optimization 1988, John Wiley and Sons.