(C) 2004, SNU Biointelligence Lab, DNA Extraction by Cross Pairing PCR Giuditta Franco, Cinzia Giagulli, Carlo Laudanna, Vincenzo.

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

shRNA libraries with DNA Sudoku Yaniv Erlich Hannon Lab Yaniv Erlich Hannon Lab shRNA libraries sequencing using DNA Sudoku.
The Case of Lynda Mann The first crime to be solved using DNA profiling.
Molecular Computation : RNA solutions to chess problems Dirk Faulhammer, Anthony R. Cukras, Richard J. Lipton, and Laura F. Landweber PNAS 2000; vol. 97:
DNA Fingerprinting and Forensic Analysis
1. The Role of the Algorithms in Computer Hsu, Lih-Hsing
1 Advisor: Professor R. C. T. Lee Speaker: Jui Peng Lu ( 盧瑞鵬 ) DNA Sequence Assembly.
1 DNA Structure Notation Operations Vincenzo Manca Dipartimento di Informatica Universita’ di Verona.
Wiki Study Lectures. Conceptually Reading and analyzing double stranded DNA in base pairs compared to single stranded DNA read in Nucleotides Determining.
Factor Graphs Young Ki Baik Computer Vision Lab. Seoul National University.
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.
Ch. 13.4: DNA Technology Applications
COMMON LISP.
DNA Computing on a Chip Mitsunori Ogihara and Animesh Ray Nature, vol. 403, pp Cho, Dong-Yeon.
Complexity of the Euclidean Algorithm (2/7) The complexity of an algorithm is the approximate number of steps necessary for the algorithm to finish as.
Slide 1 Student Presentation Software Engineering Seminar Your Name Supervisors Name SS 2015 Insert your topic name here.
Electrophoresis. A process that is used to sort fragments of DNA by placing the digested DNA in a special gel and adding electricity.
Is DNA Computing Viable for 3-SAT Problems? Dafa Li Theoretical Computer Science, vol. 290, no. 3, pp , January Cho, Dong-Yeon.
CSCI 3160 Design and Analysis of Algorithms Tutorial 10 Chengyu Lin.
Fast parallel molecular solution to the Hitting-set problem Speaker Nung-Yue Shi.
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.
© 2004, SNU Biointelligence Lab, Joining and Rotating Data with Molecules Masanori Arita, Masami Hagiya and Akira Suyama Summarized.
Using Two Color Markers to Represent Integers Featuring the Marker Brothers + - © Mathmadics Model Addition and Subtraction of Integers using Physical.
What is DNA Computing? Shin, Soo-Yong Artificial Intelligence Lab.
Class 01 – Fragment assembly. DNA sequence data DNA sequence data is the motherlode of molecular biology. 10^10 base pairs. One human genome/year. It.
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.
10.1 Chapter 10 Error Detection and Correction Data can be corrupted during transmission. Some applications require that errors be detected and.
Computational and experimental analysis of DNA shuffling : Supporting text N. Maheshri and D. V. Schaffer PNAS, vol. 100, no. 6, Summarized by.
The Inference via DNA Computing Piort Wasiewicz et al. Proceedings of the 1999 Congress on Evolutionary Computation, vol. 2, pp Cho, Dong-Yeon.
1 Biological Computing – DNA solution Presented by Wooyoung Kim 4/8/09 CSc 8530 Parallel Algorithms, Spring 2009 Dr. Sushil K. Prasad.
Binary Arithmetic for DNA Computers R. Barua and J. Misra Preliminary Proceedings of the Eighth International Meeting on DNA Based Computers, pp ,
Artificial Intelligence Project 1 Neural Networks Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Solution of Satisfiability Problem on a Gel-Based DNA computer Ji Yoon Park Dept. of Biochem Hanyang University.
Molecular Computation: RNA Solutions to Chess Problems Proceedings of the National Academy of Science (PNAS), vol. 97, no. 4, pp , February 15,
Another Realization of Aqueous Computing with Peptide Nucleic Acid August 8, 2001 Park, Ji-Yoon Masayuki Yamamura, Yusuke Hiroto, and Taku Matoba.
DNASequenceGenerator: A Program for the construction of DNA sequences Udo Feldkamp, Sam Saghafi, Wolfgang Banzhaf, Hilmar Rauhe DNA7 pp Summarized.
Molecular Evolutionary Computing (MEC) for Maximum Clique Problems March 9, 2004 Biointelligence Laboratory School of Computer Science and Engineering.
HRM Assay and Optimization 1. DNA Quality 2. Amplicon LengthAmplicon  lengths of 100–300 bp 3. Primer Selection 4. Dye Selection 5. MgCl2 Concentration.
Chapter 9. The PlayMate System ( 2/2 ) in Cognitive Systems Monographs. Rüdiger Dillmann et al. Course: Robots Learning from Humans Summarized by Nan Changjun.
Fig. 1. Cross-correlation curve indicating the fragment-length estimate for yeast nucleosome single-end data created from a paired-end dataset. The estimated.
DNA Solution of the Maximal Clique Problem
Wet (DNA) computing 2001년 9월 20일 이지연
Solution of Satisfiability Problem on a Gel-Based DNA computer
How are areas of DNA that don’t code for proteins (genes) used by our cells? How can we make use of these areas?
On Template Method for DNA Sequence Design
PNA-mediated Whiplash PCR
DNA Computing and Molecular Programming
Horn Clause Computation with DNA Molecules
A DNA Algorithm for 3-SAT(11, 20)*
Sequencing and Copying DNA
Fuzzy logic with biomolecules
Summarized by In-Hee Lee
Subhayu Basu et al. , DNA8, (2002) MEC Seminar Su Dong Kim
Horn Clause Computation by Self-Assembly of DNA Molecules
Some Thoughts on Theorem Proving
Simulating Genetic Screening
Fitness measures for DNA Computing
Operation of a Purified DNA nanoactuator
Maximal Clique Problem with Experiment
Molecular Computation by DNA Hairpin Formation
Self-Assembling DNA Graphs
Molecular Genetic Programming
DNA Solution of the Maximal Clique Problem
Decidability continued….
Electrophoresis.
Endobronchial transfection of naked TGF-β1 cDNA attenuates acute lung rejection  Franco D’Ovidio, MD, Motoki Yano, MD, Jon H Ritter, MD, Thalachallour.
Additional file 3 >HWI-EAS344:7:70:153:1969#0/1 Length = 75 
Designs for Autonomous Unidirectional Walking DNA Devices
Universal Biochip Readout of Directed Hamiltonian Path Problems
Three Dimensional DNA Structures in Computing
Presentation transcript:

(C) 2004, SNU Biointelligence Lab, DNA Extraction by Cross Pairing PCR Giuditta Franco, Cinzia Giagulli, Carlo Laudanna, Vincenzo Manca Summarized by Tak Min Ho

(C) 2004, SNU Biointelligence Lab, Abstract A special type of PCR can extract specific DNA strand from the pool of DNA It is called Cross Pairing PCR (XPCR) was tested in several conditions

(C) 2004, SNU Biointelligence Lab, Introduction DNA algorithm for solving an instance of a combinatorial problem  All of the encoded DNA strand for pool DNA  Select(extract) the exact solution  So many problems were in this stage  XPCR method can extract the accurate solution that we are needed

(C) 2004, SNU Biointelligence Lab, Cross Pairing PCR Specific sequence ‘γ’ of bases Input pool ‘P’ of different dsDNA molecules with a same length ‘n’ and sharing a common prefix and suffix Ouput pool P’ which include the given sequence γ are represented

(C) 2004, SNU Biointelligence Lab, Cross Pairing PCR

(C) 2004, SNU Biointelligence Lab, Cross Pairing PCR

(C) 2004, SNU Biointelligence Lab, Extraction Algorithm Given a string γ, let us assume that P is γ-invariant, that is, either γ does not occur at the same position in different strands of P If it is not the case, then ατ1γτ2β, ατ3γτ4β € P implies that ατ1γτ4β, ατ3γτ2β € P 1)PCR (α, γ’) => dsDNA αγ 2)PCR (γ, β) => dsDNA γβ 3)XPCR (α, β’) => dsDNA αβ (correct strand)

(C) 2004, SNU Biointelligence Lab, PCR (α, γ’) => dsDNA αγ

(C) 2004, SNU Biointelligence Lab, PCR (γ, β) => dsDNA γβ

(C) 2004, SNU Biointelligence Lab, XPCR (α, β’) => dsDNA αβ

(C) 2004, SNU Biointelligence Lab, Electrophoresis result (test of the validity of XPCR) Lane 1 : Marker (100b) Lane 2 : ατγτ-strands of human RhoA (582bp) Lane 3 : γτβ-strands (253bp) Lane 4 : XPCR, product is ατγτβ-strands (606bp)

(C) 2004, SNU Biointelligence Lab, Electrophoresis result Lane 1 : Marker (25bp) Lane 2 : αγ-strands (120bp) Lane 3 : γβ-strands (45bp) Lane 4 : ατγτβ XPCR (150bp) Lane 5 : positive control by PCR(γ,β’) Lane 6 : negative control by PCR(γ’β’) Lane 7,8 : positive controls by PCR(γ1,β’) and PCR(γ2β’) respectively, with γ1 at position 125 and γ2 at position 75

(C) 2004, SNU Biointelligence Lab, Conclusion αΑφγψβ, αδγηβ → αφγηβ, αδγψβ like ατ1γτ2β, ατ3γτ4β € P implies that ατ1γτ4β, ατ3γτ2β € P XPCR method is good for the extracting a correct answer from the DNA pool But problems could arise if the encoding is not robust enough for avoiding unexpected annealing