Nano Science and Technology Institute
Nanotech 2005 Vol. 1
Nanotech 2005 Vol. 1
Technical Proceedings of the 2005 NSTI Nanotechnology Conference and Trade Show, Volume 1
 
Chapter 9: Computational Biology
 

Computational Principles of Primer Design for Site Directed Mutagenesis

Authors:A. Novoradovsky, V. Zhang, M. Ghosh, H. Hogrefe, J.A. Sorge and T. Gaasterland
Affilation:The Rockefeller University, US
Pages:532 - 535
Keywords:biotechnology, DNA Hybridization, computational methods, numerics
Abstract:Site directed mutagenesis (SDM) is the process of altering a target DNA sequence by creating mutated copies of the original sequence where changes are intentionally designed. In the first step of an SDM experiment, an oligonucleotide primer hybridizes with the target DNA template to form a duplex that has one or more base mismatches or single-stranded DNA loops. At subsequent steps, DNA polymerase extends this imperfect DNA duplex to create a mutated copy of the initial molecule. SDM experiments tend to be more successful when using higher stability primer-template duplexes. In this work, we address the problem of optimizing primers to introduce single or multiple-site mutations, deletions, or insertions. Our approach is based on three principles. First, for mutations that introduce amino-acid changes within protein-coding DNA regions, preference in codon replacement is given to the changes that minimize the number of nucleotide substitutions. Second, heuristic rules for codon replacement have been established through SDM experiments with degenerate primers, in which different codons were observed with different frequencies among the successful mutant sequences. Third, primer length and primer position relative to the mutated site is chosen to minimize duplex free energy, thus maximizing duplex stability.
Computational Principles of Primer Design for Site Directed MutagenesisView PDF of paper
ISBN:0-9767985-0-6
Pages:844
Hardcopy:$109.95
 
Order:Mail/Fax Form
Up
© 2014 Nano Science and Technology Institute. All Rights Reserved.
Terms of Use | Privacy Policy | Contact Us | Site Map