Molecular Computation by DNA Hairpin Formation

Slides:



Advertisements
Similar presentations
Solution of a 20-Variable 3-SAT Problem on a DNA Computer R. S. Briach, N. Chelyapov, C. Johnson, P. W. K. Rothemund, L. Adleman 발표자 : 문승현.
Advertisements

Molecular Computation : RNA solutions to chess problems Dirk Faulhammer, Anthony R. Cukras, Richard J. Lipton, and Laura F. Landweber PNAS 2000; vol. 97:
Article for analog vector algebra computation Allen P. Mils Jr, Bernard Yurke, Philip M Platzman.
Cell and Microbial Engineering Laboratory Solution of a 20-Variable 3-SAT Problem on a DNA Computer Ravinderjit S. Braich, Nickolas.
JSPS Project on Molecular Computing (presentation by Masami Hagiya) funded by Japan Society for Promotion of Science Research for the Future Program –biocomputing.
General Genetics. PCR 1.Introduce the students to the preparation of the PCR reaction. PCR 2.Examine the PCR products on agarose gel electrophoresis.
The polymerase chain reaction (PCR) rapidly
DNA Replication DNA mRNA protein transcription translation replication Before each cell division the DNA must be replicated so each daughter cell can get.
Bioinformatics/PCR Lab How does having a certain genetic marker affect chances of getting brain cancer?
DNA Technology- Cloning, Libraries, and PCR 17 November, 2003 Text Chapter 20.
PCR optimization. Primers – design must be good but influenced by template sequence Quality of template DNA/impurities Components of PCR may need to be.
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
DNA Computing on a Chip Mitsunori Ogihara and Animesh Ray Nature, vol. 403, pp Cho, Dong-Yeon.
Module 1 Section 1.3 DNA Technology
A new DNA computing model for the NAND gate based on induced hairpin formation 생물정보학 협동과정 소 영 제.
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.
1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of the field 5Splicing systems.
What is DNA Computing? Shin, Soo-Yong Artificial Intelligence Lab.
6.3 Advanced Molecular Biological Techniques 1. Polymerase chain reaction (PCR) 2. Restriction fragment length polymorphism (RFLP) 3. DNA sequencing.
Polymerase Chain Reaction A process used to artificially multiply a chosen piece of genetic material. May also be known as DNA amplification. One strand.
DNA computing on a chip Mitsunori Ogihara and Animesh Ray Nature, 2000 발표자 : 임예니.
1 Biological Computing – DNA solution Presented by Wooyoung Kim 4/8/09 CSc 8530 Parallel Algorithms, Spring 2009 Dr. Sushil K. Prasad.
By: Cody Alveraz Ted Dobbert Morgan Pettit
Solution of Satisfiability Problem on a Gel-Based DNA computer Ji Yoon Park Dept. of Biochem Hanyang University.
Lab 22 Goals and Objectives: EDVOKIT#300: Blue/White Cloning of a DNA Fragment Calculate transformation efficiencies Compare control efficiency to cloned.
Cascading Whiplash PCR with a Nicking Enzyme MEC Seminar Park, Ji-Yoon Daisuke Matsuda and Masayuki Yamamura.
PCR Polymerase chain reaction. PCR is a method of amplifying (=copy) a target sequence of DNA.
DNA Fingerprinting Review. Why DNA? DNA is individual evidence DNA links or eliminates a suspect to a crime DNA identifies a victim even if no body is.
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.
Albia Dugger Miami Dade College Cecie Starr Christine Evers Lisa Starr Chapter 15 Biotechnology (Sections )
From the double helix to the genome
The stroke size should be 0.25
Gel Electrophoresis Technique for separating DNA molecules based on size Load DNA mixture into gel containing pores of varying sizes Subject DNA to electric.
Polymerase Chain Reaction (PCR)
Biogenetic Engineering
EDVOKIT#300: Blue/White Cloning of a DNA Fragment
Jeopardy Final Jeopardy Gene Cloning Plasmids Ligase PCR $100 $100
Recombinant DNA Technology
21.8 Recombinant DNA DNA can be used in
DNA Solution of the Maximal Clique Problem
PCR TECHNIQUE
Wet (DNA) computing 2001년 9월 20일 이지연
COURSE OF MICROBIOLOGY
Chapter 13.2 Manipulating DNA.
PCR uses polymerases to copy DNA segments.
DNA Implementation of Theorem Proving
Reminders Unit 8 Exam- Tuesday, March, 21st
Solution of Satisfiability Problem on a Gel-Based DNA computer
Chapter 14 Bioinformatics—the study of a genome
Biogenetic Engineering
Polymerase Chain Reaction (PCR) technique
Biogenetic Engineering
The student is expected to: (6H) describe how techniques such as DNA fingerprinting, genetic modifications, and chromosomal analysis are used to study.
DNA Evidence.
A DNA computing readout operation based on structure-specific cleavage
Fuzzy logic with biomolecules
Recombinant DNA Unit 12 Lesson 2.
Summarized by In-Hee Lee
PCR uses polymerases to copy DNA segments.
JSPS Project on Molecular Computing (presentation by Masami Hagiya)
PCR uses polymerases to copy DNA segments.
DNA computing on surfaces
History of DNA Fingerprinting
Biotechnology Part 2.
PCR uses polymerases to copy DNA segments.
DNA Solution of the Maximal Clique Problem
PCR uses polymerases to copy DNA segments.
PCR uses polymerases to copy DNA segments.
PCR uses polymerases to copy DNA segments.
Presentation transcript:

Molecular Computation by DNA Hairpin Formation Sakamoto, Gouzu, Komiya, Kiga, Yokoyama, Yokomori and Hagiya 발표자 : 윤주영

SAT Problem To find Boolean-value assignments that satisfy the given formula CNF-SAT CNF-SAT is form of A clause is form of

Solution of CNF-SAT Literal string conjunction of literal selected from each clause No pair of complementary literals -> Formula is satisfiable Hairpin formation One or more pair of complementary literals

Algorithm for CNF-SAT Instance for Experiment Generate literal strings Allow ssDNA molecules to form hairpins Remove hairpin-forming molecules Instance for Experiment 6-variable 10-clause instance Unique solution (a,b,c,d,e,f)=(0,1,1,0,1,0) Literal strings : 310 = 59049

Generate Literal Strings DNA for each literal in clause i Linker i-1 on left and linker i on right Bst XI recognize 5’-CCAWNNNNWTGG-3’ NNNN covers linker -> Literal is form of 5’-WTGG…CCAW-3’ Bst NI site CCAGG is contained for hairpin-removing step 30 literals were mixed in a test tube (pool 0) Concatenated with DNA ligase Ligation products were separated by gel electrophoresis

Remove hairpin-forming molecules Allow ssDNA molecules to form hairpins Performed by regulating temperature Two technique for hairpin-removing Enzymatic digestion Double-stranded regions of hairpin molecule become susceptible to Bst NI Exclusive PCR Increase population of non-hairpin molecules by PCR DNA polymerase can’t duplicate a DNA template that forms stable hairpins Diluted reaction mixture after each PCR cycle

Remove hairpin-forming molecules Experiment result Pool 1 (Fig 2) Digest twice with Bst NI on pool 0 and recover remained molecule by PCR Result : 0 satisfying string in 11 clones Pool 2 ePCR processing of 10 cycles and one more destructive process on pool 1 Result : 1 satisfying string in 16 clones Pool 3 (Fig 3) ePCR processing of 20 cycles on pool 1 Result : 6 satisfying string in 37 clones

Conclusion Hairpin-based computation Advantage All clauses were processed simultaneously In previous computations, each clauses was examined by a few laboratory steps No negative error

Conclusion Drawback Inefficiency with respect to required amount of DNA Lipton’s method require 2n or less molecules with n variable Scalablity For large instance, bias of literal strings occurs Incompleteness of understanding of nature of hairpin molecules Limit to available length of hairpin remains to be determined

Further works Unraveling nature of possible bias during PCR Sequence design or experimental conditions that ensure hairpin formation