Computational and experimental analysis of DNA shuffling

Slides:



Advertisements
Similar presentations
An evolutionary Monte Carlo algorithm for predicting DNA hybridization Joon Shik Kim et al. (2008) (Fri) Computational Modeling of Intelligence.
Advertisements

Author: Jim C. Huang etc. Lecturer: Dong Yue Director: Dr. Yufei Huang.
Additional Powerful Molecular Techniques Synthesis of cDNA (complimentary DNA) Polymerase Chain Reaction (PCR) Microarray analysis Link to Gene Therapy.
Physical Mapping I CIS 667 February 26, Physical Mapping A physical map of a piece of DNA tells us the location of certain markers  A marker is.
Estimating recombination rates using three-site likelihoods Jeff Wall Program in Molecular and Computational Biology, USC.
Protein Sequence Comparison Patrice Koehl
Sequence comparison: Significance of similarity scores Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas.
DNA Replication DNA mRNA protein transcription translation replication Before each cell division the DNA must be replicated so each daughter cell can get.
Simulation of streamer propagation using a PIC-MCC code. Application to Sprite discharges. Olivier Chanrion and Torsten Neubert Danish National Space Center.
PCR Primer Design Guidelines
WORKSHOP (1) Presented by: Afsaneh Bazgir Polymerase Chain Reaction
From Haystacks to Needles AP Biology Fall Isolating Genes  Gene library: a collection of bacteria that house different cloned DNA fragments, one.
EDVOKIT#300: Blue/White Cloning of a DNA Fragment
Genomic walking (1) To start, you need: -the DNA sequence of a small region of the chromosome -An adaptor: a small piece of DNA, nucleotides long.
Haplotype Blocks An Overview A. Polanski Department of Statistics Rice University.
Nermeen Kamel Abe El Moniem Laboratory of Radiation Biology, JINR Supervised by Dr. Oleg Belov Modeling of DNA damages induction under ionizing radiation.
Polymerase Chain Reaction (PCR) What is PCR?: Use of DNA polymerase to selectively amplify a segment of DNA from a much larger sample. Xeroxing DNA, start.
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.
Molecular Computing and Evolution In Vitro Evolution In Vitro Clustering Genetic Algorithms Artificial Immune Systems Biological Evolution and Molecular.
Effect of the DinG helicase on genome instability of G quartet sequences: Determination and Analysis of Mutation Rates Glen Hamman Jan Varada.
Comp. Genomics Recitation 3 The statistics of database searching.
Lecture 10 – Models of DNA Sequence Evolution Correct for multiple substitutions in calculating pairwise genetic distances. Derive transformation probabilities.
Biomolecular Computation in Virtual Test Tubes 7 th International Meeting on DNA Based Computers, p75-83, June 10-13, 2001 Max Garzon, Chris Oehmen Summarized.
Highlights of DNA Technology. Cloning technology has many applications: Many copies of the gene are made Protein products can be produced.
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.
Phylogeny Ch. 7 & 8.
Computational and experimental analysis of DNA shuffling : Supporting text N. Maheshri and D. V. Schaffer PNAS, vol. 100, no. 6, Summarized by.
Polymerase Chain Reaction A process used to artificially multiply a chosen piece of genetic material. May also be known as DNA amplification. One strand.
Chapter 20 DNA Technology and Genomics. Biotechnology is the manipulation of organisms or their components to make useful products. Recombinant DNA is.
Hub Location–Allocation in Intermodal Logistic Networks Hüseyin Utku KIYMAZ.
Polymerase Chain Reaction (PCR) Used to amplify a sample of DNA Many applications, including: DNA sequencing Phylogeny Diagnosis of genetic disorders Identity.
How does DNA copy itself?. The DNA molecule “unzips” as the rungs of the ladder separate and the molecule splits into two single strands. How DNA copies.
Big Idea The distribution of the relative frequencies of the outcomes from a situation can be displayed in tables and graphs. Goals Compare relative frequency,
nome/program.html.
The Birthday Problem. The Problem In a group of 50 students, what is the probability that at least two students share the same birthday?
Last Class Protein Protein Carbohydrate Carbohydrate Lipid Lipid Nucleic acid Nucleic acid.
DNASequenceGenerator: A Program for the construction of DNA sequences Udo Feldkamp, Sam Saghafi, Wolfgang Banzhaf, Hilmar Rauhe DNA7 pp Summarized.
The Multistrand Simulator: Stochastic Simulation of the Kinetics of Multiple Interacting DNA Strands Joseph Schaeffer, Caltech (slides by John Reif)
Evolutionary Computation: Advanced Algorithms and Operators
Topics to be covered Basics of PCR
Copyright Pearson Prentice Hall
EDVOKIT#300: Blue/White Cloning of a DNA Fragment
Genetic-Algorithm-Based Instance and Feature Selection
POA Simulation MEC Seminar 임희웅.
Naotoshi Seo, Hiroshi Toyoizumi Performance Evaluation Laboratory
Summarized by In-Hee Lee
Molecular Cloning: Polymerase Chain Reaction
Polymerase Chain Reaction
PNA-mediated Whiplash PCR
Modeling Biological Systems
Polymerase Chain Reaction (PCR) technique
Fuzzy logic with biomolecules
PRINCIPLES OF CROP PRODUCTION (3 CREDIT HOURS)
Byoung-Tak Zhang Summarized by HaYoung Jang
Phenylthiocarbamide (PTC)
Copyright Pearson Prentice Hall
Fitness measures for DNA Computing
Volume 102, Issue 1, Pages (January 2012)
Season 1: Of Genes and Germs Episode 3: DNA Extraction
DNA Assignment Example.
Antigenic Variation in the Lyme Spirochete: Insights into Recombinational Switching with a Suggested Role for Error-Prone Repair  Theodore B. Verhey,
The Fuss about Mus81  James E Haber, Wolf-Dietrich Heyer  Cell 
Dr. Israa ayoub alwan Lec -12-
DNA Interlude.
DNA Solution of the Maximal Clique Problem
Copyright Pearson Prentice Hall
Copyright Pearson Prentice Hall
Copyright Pearson Prentice Hall
Continuous distribution curve.
Finite Field Arithmetic using Self-Assembly of DNA Tilings
Presentation transcript:

Computational and experimental analysis of DNA shuffling Narendra Maheshri and David V. Schaffer PNAS, March 18, 2003; 100(6): 3071 – 3076 Summarized by HaYoung Jang

DNA shuffling

Model Development 100-150 full-length sequences 1,500-5,000 ssDNA molecules Poisson fragmentation process Yield an exponential length distribution Reassembly process ssDNA molecules randomly collide Decision is made whether the molecules will hybridize Hybridized molecules are extended with a fidelity and processivity

Model Development Determine that collisions are not limiting over typical experimental time scales. Calculate a Boltzmann weighted probability for each annealing event. (at least some minimum overlap – 7 base pairs) Nearest-neighbor model The fragment sequences are tracked throughout the process

Model comparison with experimental GFP shuffling

Model Insights The creation of “junk” sequences, or ones that do not resemble a full-length gene A natural tradeoff between the percent of sequences containing a fully reassembled product and the frequency of crossovers in those sequences The creation of multimetric reassembly peaks

Annealing thermodynamics Two-state model of hybridization in which two ssDNA molecules transit directly between a single-stranded and double-stranded state. Does not currently consider gapped annealing events.

Conclusion Develop and validate a framework for modeling PCR-based in vitro genetic diversification processes that is designed to account for changes in nearly all of the experimental parameters involved.