Ligation Errors in DNA Computing Y. Aoi, T. Yoshinobu, K. Tanizawa, K. Kinoshita and H. Iwasaki Biosystems 52(1999), pp.181-187 Summarized by In-Hee Lee.

Slides:



Advertisements
Similar presentations
Cell and Microbial Engineering Laboratory Solution of a 20-Variable 3-SAT Problem on a DNA Computer Ravinderjit S. Braich, Nickolas.
Advertisements

Sorting Cancer Karyotypes by Elementary Operations Michal Ozery-Flato and Ron Shamir School of Computer Science, Tel Aviv University.
McGraw-Hill Technology Education © 2006 by the McGraw-Hill Companies, Inc. All rights reserved CHAPTER PROGRAMMING AND LANGUAGES.
Unit 4 – Molecular Genetics (Ch. 5.2)
Pp Replication Elongation DNA polymerase – enzyme which does what? In what direction? What is the main version responsible for replication?
T WO WAY ANOVA WITH REPLICATION  Also called a Factorial Experiment.  Replication means an independent repeat of each factor combination.  The purpose.
Lab Exam 2 Overview. Bacterial Transformation To impart new phenotype by adding expressible genes Why use bacteria? – Rapid growth – Plasmids as vectors.
A New Approach to Advance the DNA Computing Z. F. Qiu and M. Lu Applied Soft Computing, v.3, pp , 2003 Summarized by In-Hee Lee.
P2P Architecture Case Study: Gnutella Network
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.
Beyond Silicon: Tackling the Unsolvable with DNA.
1 Computing with DNA L. Adelman, Scientific American, pp (Aug 1998) Note: This ppt file is based on a student presentation given in October, 1999.
3.A.1 DNA and RNA Part II: Replication cases DNA, and in some cases RNA, is the primary source of heritable information. DNA, and in some cases RNA, is.
computer
The Discriminant It is sometimes enough to know what type of number a solution will be, without actually solving the equation. From the quadratic formula,
Is DNA Computing Viable for 3-SAT Problems? Dafa Li Theoretical Computer Science, vol. 290, no. 3, pp , January Cho, Dong-Yeon.
DNA Replication. The Model So far: Summarize in the top box, what you know about DNA structure. Why did we start with DNA in our question about how cells.
What is DNA Computing? Shin, Soo-Yong Artificial Intelligence Lab.
Section 5.2 cont’d SBI4UP MRS. FRANKLIN. Errors in DNA Replication When the DNA is being replicated there are many proteins involved in the process. Due.
Chapter 12 Topics Chapter 12 Topics Models of Replication Prokaryotic and Eukaryotic Replication Models of Recombination: read pp
Cell and Microbial Engineering Laboratory Solving TSP on Lab-on-a-Chip 1 Jiyoun Lee.
1 Biological Computing – DNA solution Presented by Wooyoung Kim 4/8/09 CSc 8530 Parallel Algorithms, Spring 2009 Dr. Sushil K. Prasad.
Chapter 14 Programming and Languages McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved.
DNA Repair DNA repair is a system used to correct DNA damage caused by either: A- Errors during DNA replication including incorrect base-pairing (mismatching.
Todd T. Eckdahl and A. Malcolm Campbell
Using Lateral Capillary Forces to Compute by Self-assembly Paul W. K. Rothemund PNAS, Feb. 1, 2000, vol. 97, no. 3, pp Summarized by Lee, In-Hee.
1 Naoto Takahashi, Atsushi Kameda, Masahito Yamamoto, and Azuma Ohuchi Hokkaido University, JST Aqueous Computing with DNA Hairpin-based RAM Summarized.
Cell Surface Targeting: The week of waiting 8/14/06.
Towards Autonomous Molecular Computers Towards Autonomous Molecular Computers Masami Hagiya, Proceedings of GP, Nakjung Choi
DNA Replication and Repair Chapter 13.3 AP Biology Fall 2010.
Source Page US:official&tbm=isch&tbnid=Mli6kxZ3HfiCRM:&imgrefurl=
Replication pp Quick Review (don’t need to write this)  What is DNA made of?  What type of bond holds a nucleotide together?  What type of.
IP Routing table compaction and sampling schemes to enhance TCAM cache performance Author: Ruirui Guo a, Jose G. Delgado-Frias Publisher: Journal of Systems.
Introduction to Oligonucleotide Microarray Technology
nome/program.html.
ПЕЧЕНЬ 9. Закладка печени в период эмбрионального развития.
DNA Questions What makes up a DNA backbone? How would you describe how DNA looks? Name the 4 bases that make up DNA. “T” base can only match with? What.
Путешествуй со мной и узнаешь, где я сегодня побывал.
Computation by Self-assembly of DNA Graphs N. Jonoska, P. Sa-Ardyen, and N. Seeman Genetic Programming and Evolvable Machines, v.4, pp , 2003 Summarized.
DNA Strand Algebracuits 1 Luca Cardelli, Strand Algebras for DNA Computing, DNA 15 Conference, 2009.
SNPs in forensic genetics: a review on SNP typing methodologies
Summarized by In-Hee Lee
Volume 4, Issue 2, Pages (August 1999)
Date of download: 1/3/2018 Copyright © ASME. All rights reserved.
Page 1. Page 2 Page 3 Page 4 Page 5 Page 6 Page 7.
BACK SOLUTION:
Comprehensive Mutation Analysis of the TERT Promoter in Bladder Cancer and Detection of Mutations in Voided Urine  Carolyn D. Hurst, Fiona M. Platt, Margaret.
Ligation with Nucleic Acid Sequence–Based Amplification
DNA-based Theorem Proving - Present Work
Volume 9, Issue 1, Pages (January 1999)
 MISMATCH REPAIR: corrects mistakes when DNA is copied
Monitoring Single-Stranded DNA Secondary Structure Formation by Determining the Topological State of DNA Catenanes  Xingguo Liang, Heiko Kuhn, Maxim D.
Engineering the End: DNA Processing at Human Telomeres
Molecular computing: Does DNA compute?
DNA computing on surfaces
A Protective Mechanism of Visible Red Light in Normal Human Dermal Fibroblasts: Enhancement of GADD45A-Mediated DNA Repair Activity  Yeo Jin Kim, Hyoung-June.
DNA Replication Helicase DNA Polymerase DNA Ligase
Multiplying binomial with polynomial
Volume 126, Issue 5, Pages (May 2004)
Polynucleotide Ligase Activity of Eukaryotic Topoisomerase I
Finite elements Pisud Witayasuwan.
Perfect Cubes.
Research Paper Overview.
Hanyang University Proteome Research Lab
Investigation 1 Claims:
Luisa Lunardon, MD, Aimee S. Payne, MD, PhD 
DNA Solution of Hard Computational Problems
Types of Errors And Error Analysis.
Three Dimensional DNA Structures in Computing
Presentation transcript:

Ligation Errors in DNA Computing Y. Aoi, T. Yoshinobu, K. Tanizawa, K. Kinoshita and H. Iwasaki Biosystems 52(1999), pp Summarized by In-Hee Lee

Introduction In Adleman’s method – Generating solutions is important. – The ligation of nodes should be reliable. Investigate the reliability of the splint- aided ligation process.

Test of Errors Dependence on the number of mismatches – 300pmol of each oligo. – 2.8 units of T4 DNA ligase – Incubation for 20 h at 16 º C

Test of Errors # of mismatches 8% page, EtBr An error may occur in case of single mismatch

Test of Errors Dependence on the combination of bases Fluorescein isothiocyanate (FITC)

Test of Errors The yield of ligation 50 pmol of each oligo 0.8 units of T4 DNA ligase incubation at 16 º C for 10 m or 35 m

Test of Competing Two sets of experiments 1.1 base mismatch w/o competing  G-T or A-C 2.1 base mismatch w competing  S strand and 4 R strands 3.Perfect match

Test of Competing 100 pmol of each oligo 1.4 units of T4 DNA ligase Incubated for 30 m at 16 º C FITCEtBr staining

Test of Competing Product of 1 is at slightly lower position Product of 1 is not so much stained by EtBr. – Single stranded Main product of 2 is at the same position as the product of 3 – Main product of 2 is from perfect match – In competing condition, perfect match wins the race.