A PNA-mediated whiplash PCR- based program for in vitro protein evolution 2002.8.16 Eun-jeong Lee.

Slides:



Advertisements
Similar presentations
CS6800 Advanced Theory of Computation
Advertisements

LECTURE 17: RNA TRANSCRIPTION, PROCESSING, TURNOVER Levels of specific messenger RNAs can differ in different types of cells and at different times in.
Module 12 Human DNA Fingerprinting and Population Genetics p 2 + 2pq + q 2 = 1.
CH. 11 : Transcriptional Control of Gene Expression Jennifer Brown.
Modular proteins I Level 3 Molecular Evolution and Bioinformatics Jim Provan Patthy Sections –
Article for analog vector algebra computation Allen P. Mils Jr, Bernard Yurke, Philip M Platzman.
Ji Youn Lee School of Chemical Engineering Seoul National University
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
1 Directed Mutagenesis and Protein Engineering. 2 Mutagenesis Mutagenesis -> change in DNA sequence -> Point mutations or large modifications Point mutations.
Protein Modules An Introduction to Bioinformatics.
Using a Genetic Algorithm for Approximate String Matching on Genetic Code Carrie Mantsch December 5, 2003.
Evaluation of the Haplotype Motif Model using the Principle of Minimum Description Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, R. Ravi and Russell.
Geometric Interpretation of Crossover Alberto Moraglio BCTCS 2005.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Protein Synthesis.
By: Dr. Velur Rajappa Arun Birabar Satanik panda
Multiple Sequence Alignment CSC391/691 Bioinformatics Spring 2004 Fetrow/Burg/Miller (Slides by J. Burg)
google. com/search
Genetic Programming on Program Traces as an Inference Engine for Probabilistic Languages Vita Batishcheva, Alexey Potapov
Genetic Algorithms and Ant Colony Optimisation
Recombinant DNA I Basics of molecular cloning Polymerase chain reaction cDNA clones and screening.
Jonathan Sun University of Illinois at Urbana Champaign BIOE 506 February 15, 2010
3 main types of RNA All are made from a DNA Template mRNA: encode AA sequence of one of more polypeptides from a gene or set of genes tRNA: reads info.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Remember the limitations? –You must know the sequence of the primer sites to use PCR –How do you go about sequencing regions of a genome about which you.
Introduction to GAs: Genetic Algorithms How to apply GAs to SNA? Thank you for all pictures and information referred.
Molecular Computing and Evolution In Vitro Evolution In Vitro Clustering Genetic Algorithms Artificial Immune Systems Biological Evolution and Molecular.
Neural and Evolutionary Computing - Lecture 5 1 Evolutionary Computing. Genetic Algorithms Basic notions The general structure of an evolutionary algorithm.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
A design for cellular evolutionary computation by using bacteria
Evolution of new protein topologies through multistep gene rearrangements Sergio G Peisajovich, Liat Rockah & Dan S Tawfik.
A Biology Primer Part III: Transcription, Translation, and Regulation Vasileios Hatzivassiloglou University of Texas at Dallas.
Copyright © 2009 Pearson Education, Inc. Chapter 14 The Genetic Code and Transcription Copyright © 2009 Pearson Education, Inc.
Protein Synthesis Transcription.
A PCR-based Protocol for In Vitro Selection of Non-Crosshybridizing Oligonucleotides R. Deaton, J. Chen, H. Bi, M. Garzon, H. Rubin and D. H. Wood.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
1 DNA starts to Learn Poker David Harlan Wood Hong Bi Steven O.Kimbrough Dongjun Wu Junghuei Chen.
A Chinese Postman Problem Based on DNA Computing Z. Yin, F. Zhang, and J. Xu* J. Chem. Inf. Comput. Sci. 2002, 42, Summarized by Shin, Soo-Yong.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
The first step to model DTG-PCR Ji Youn Lee Cell and microbial engineering laboratory Seoul National University.
PCR Polymerase Chain Reaction PCR Polymerase Chain Reaction Marie Černá, Markéta Čimburová, Marianna Romžová.
What is phage display? An in vitro selection technique using a peptide or protein genetically fused to the coat protein of a bacteriophage.
Da-Hyeong Cho Protein Engineering Laboratory Department of Biotechnology and Bioengineering Sungkyunkwan University Site-Directed Mutagenesis.
Site-Directed Mutagenesis
Agenda 3/8 Transcription Notes Epigenetics Activity Turn in: Nothing Homework: Transcription video and notes, Chp 14 reading/notes, RNA reading/questions.
Polymerase Chain Reaction (PCR): DNA Replication in vitro DNA replication in vivo DNA replication in vivo –Occurs in S-phase –Helicase, primers, DNA polymerase.
DNA Isolation. Nucleic Acid Structure & Function DNA & RNA are composed of Nucleotides A nucleotide consists of three covalently-linked parts: –A nitrogen.
9.2 Copying DNA KEY CONCEPT The polymerase chain reaction rapidly copies segments of DNA.
Molecular Evolutionary Computing (MEC) for Maximum Clique Problems March 9, 2004 Biointelligence Laboratory School of Computer Science and Engineering.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Lecture 8 A toolbox for mechanistic biologists (continued)
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
School of Computer Science & Engineering
DNA Solution of the Maximal Clique Problem
Higher Biology Gene Expression Mr G R Davidson.
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
Protein Synthesis Genetics.
MICROBIAL GENETICS CHAPTER 7.
PROTEIN SYNTHESIS THE DETAILS.
Directed Mutagenesis and Protein Engineering
A DNA-based in vitro Genetic Program
Graphs G = (V, E) V are the vertices; E are the edges.
DNA Solution of the Maximal Clique Problem
Figure Genetic characterization of the novel GYG1 gene mutation (A) GYG1_cDNA sequence and position of primers used. Genetic characterization of the novel.
Presentation transcript:

A PNA-mediated whiplash PCR- based program for in vitro protein evolution Eun-jeong Lee

Abstract The directed evolution of proteins –Using in vitro domainal shuffling strategy –Based on POA –Inefficient (‘cause backhybridization during POA), too coarse ( ‘cause domainal level) In this work, –Compact structural unit, or module & associated pseudo-module are adopted In vitro method –PWPCR, RNA-protein fusion, and restriction-based recombination (for a given selection motif)

Introduction (1) Shuffled dsDNA libraries by Dnase I digestion & POA (I.e., DNA shuffling) –unlikely to be capable of evolving substantially novel protein folds, and the non-homologous swapping of folded structures  Key for optimizing the search of protein sequence space  Domains

Introduction (2) Domains –string of nonoverlapping, independently folding elements – residues in length Protein evolution by in vitro domainal shuffling –polynucleotide species encoding for each domain+set of chimeric oligonucleotide each of which encoding domain- domain boundary (in solution) –iterated annealing, polymerase extension, dissociation of this strand set =>production of library of domain-shuffled dsDNAs -has many problems

Introduction (3) PWPCR is combined w/ RNA-protein fusion –to implement a high-efficiency exon shuffling operation –‘module’ rather than the domain, is adopted as the basic element of protein structure module –compact structural unit each shuffled protein : a walk on a predefined graph each vertex : a pseudo-module contained in an initial protein set of interest

The Module Picture of Protein Architecture (1) The frequent occurance of introns within domains –belies the view that each exon encodes a domain –suggests the decomposition of domains into a set of smaller, modules modules –corresponds roughly to an exon –by exploiting (1) the tendency for module junctions to be buried (2) the tendency of modules to form a locally compact unit

The Module Picture of Protein Architecture (2) basic module structure –unit-turn-unit –a length is correlated w/ the radius of the protein ( residues : about half the mean exon length) pseudo-module –the element bt’n the approximate midpoints of adjacent modules –coil-unit-coil structure –a basic structural element of proteins

The Pseudo-module Generating Graph P (prtein) –decomposed into N to C-terminal sequence of q+1 pseudo-modules –modeled as a q step tour of the digraph, Gp(V,E) composition of Gp(V,E) –V={V i :i=1,…,q+1}, Vi : i th pseudo-module from P’s N- terminus –E={E i,i+1 :i=1,…,q}, E s,t : directed edge bt’n source and target vertices Pseudomodule graph representation –facilitates a discussion of the generation problem for sets of proteins derived from P by various forms of pseudo-module sampling

shuffling –the protein set generated by the random sampling of q+1 pseudo-modules from P –corresponds to the set of q-step walks on Gp(V,E + ) ( ; fully interconnected graph). Pseudo-module shuffling –shuffling within specific regions of P (other regions remain unshuffled) –Gp(V,E s ) ; pseudo-module graph The Pseudo-module Generating Graph

An in vitro Genetic Program for Protein Evolution An in vitro method is presented for evolving sets of proteins w/ high affinity for a predifined seletion motif subject to a specified pseudo-module graph, Gp(V,E ) begin w/ initialization and followed by iterated application of 3 step cycle

Three step cycle (1)genotype generation by PWPCR followed by parallel strand conversion to dsDNA (2)fitness evaluation and selection by the generation of a set of RNA-protein fusions, followed by selection based on affinity to an immobilized selection motif (3)recombination using a restriction enzyme-based crossover operation

Initialization edge initiatio n terminatio n splintin g strand x s, x t, a s, a t : edge specific / s:source, t:target / W,Z : halves of re.en site / X,x s,Y,x t : implement the transition, V s -> V t / Pro : T7 promoter seq. / P : primer annealing / a i : initial vertex / Q : primer annealing / Ini : Shine-Dalgarno seq. X : target site for triplex

PWPCR-based Generation of a dsDNA Library

Fitness Evaluation and Selection via RNA-protein Fusion

tRNA

structure of ribosome and elongation

Restriction Enzyme-based Recombination