Fuzzy logic with biomolecules

Slides:



Advertisements
Similar presentations
Design of a biomolecular Device that executes process Algebra Urmi Majumder and John Reif Department of Computer Science Duke University DNA15, JUNE 10,
Advertisements

13-2 Manipulating DNA.
Introduction to Bioinformatics Molecular Biology Tools.
Molecular Biology of Genes Chapters DNA Technology (not in your book)
Presented By:- Anil Kumar MNW-882-2K11
DNA Replication DNA mRNA protein transcription translation replication Before each cell division the DNA must be replicated so each daughter cell can get.
PCR Primer Design Guidelines
DNA Computing: implementation of data flow logical operations P. Wasieqicz, A. Malinowski, R. Nowak, J.J. Mulawka, P. Borsuk, P. Weglenski, and A. Plucienniczak.
DNA Computing on a Chip Mitsunori Ogihara and Animesh Ray Nature, vol. 403, pp Cho, Dong-Yeon.
Strand Design for Biomolecular Computation
Beyond Silicon: Tackling the Unsolvable with DNA.
Manipulating DNA.
The Fidelity of the Tag-Antitag System J. A. Rose, R. J. Deaton, M. Hagiya, And A. Suyama DNA7 poster Summarized by Shin, Soo-Yong.
13-1 Changing the Living World
A new DNA computing model for the NAND gate based on induced hairpin formation 생물정보학 협동과정 소 영 제.
Is DNA Computing Viable for 3-SAT Problems? Dafa Li Theoretical Computer Science, vol. 290, no. 3, pp , January Cho, Dong-Yeon.
Warm-Up #33 Answer questions #1-5 on Text page 321, Section Assessment.
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.
What is DNA Computing? Shin, Soo-Yong Artificial Intelligence Lab.
Locked Nucleic Acid - Novel DNA Anolog MEC Meeting Hanyang University Proteome Research Lab Park, Ji-Yoon.
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.
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.
Manipulating DNA. Scientists use their knowledge of the structure of DNA and its chemical properties to study and change DNA molecules Different techniques.
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.
A Software Tool for Generating Non-Crosshybridizing libraries of DNA Oligonucleotides Russell Deaton, junghuei Chen, hong Bi, and John A. Rose Summerized.
FOOTHILL HIGH SCHOOL SCIENCE DEPARTMENT Chapter 13 Genetic Engineering Section 13-2 Manipulating DNA.
(C) 2004, SNU Biointelligence Lab, DNA Extraction by Cross Pairing PCR Giuditta Franco, Cinzia Giagulli, Carlo Laudanna, Vincenzo.
DNA Fingerprinting Maryam Ahmed Khan February 14, 2001.
Bell Work DNA replication is the process of making a copy of DNA. DNA replication occurs before a cell divides so each cell has a copy of DNA. Grab science.
GENETIC ENGINEERING. What does something that has been genetically engineered mean?
DNASequenceGenerator: A Program for the construction of DNA sequences Udo Feldkamp, Sam Saghafi, Wolfgang Banzhaf, Hilmar Rauhe DNA7 pp Summarized.
13-2: Manipulating DNA Biology 2. Until very recently breeders could not change the DNA of the plants/animals they were breeding Scientists use DNA structure.
PCR and Gel Electrophoresis Notes. PCR Put a sample of DNA in the thermocycler with free nucleotides and Taq polymerase Heat it up to 98 degrees Celsius.
Molecular Evolutionary Computing (MEC) for Maximum Clique Problems March 9, 2004 Biointelligence Laboratory School of Computer Science and Engineering.
There’s one last thing you need to know about DNA structure…
Genetic Engineering.
Recombinant DNA Technology
PCR TECHNIQUE
Summarized by In-Hee Lee
Wet (DNA) computing 2001년 9월 20일 이지연
Section 3: Gene Technologies in Detail
A Surface-Based DNA Algorithm for the Expansion of Symbolic Determinants Z. Frank Qiu and Mi Lu Third Workshop on Bio-Inspired Solutions to Parallel Processing.
Chapter 13.2 Manipulating DNA.
KEY CONCEPT DNA replication copies the genetic information of a cell.
On Template Method for DNA Sequence Design
PNA-mediated Whiplash PCR
DNA Computing and Molecular Programming
The student is expected to: (6H) describe how techniques such as DNA fingerprinting, genetic modifications, and chromosomal analysis are used to study.
Horn Clause Computation with DNA Molecules
Continous-Action Q-Learning
DNA Library Design for Molecular Computation
Genetic Engineering.
Summarized by In-Hee Lee
V. Chan, D. J. Graves, and S. E. McKenzie
Horn Clause Computation by Self-Assembly of DNA Molecules
KEY CONCEPT DNA replication copies the genetic information of a cell.
Sexual reproduction creates unique combinations of genes.
Fitness measures for DNA Computing
DNA computing on surfaces
Operation of a Purified DNA nanoactuator
Molecular Computation by DNA Hairpin Formation
Simulation of Hybridization
Artificial Intelligence Chapter 7 Agents That Plan
Molecular Genetic Programming
Russell Deaton, junghuei Chen, hong Bi, and John A. Rose
9-2 Replication of DNA.
Nearest-neighbor model for Tm
Genetic Engineering CH. 13.
Three Dimensional DNA Structures in Computing
Presentation transcript:

Fuzzy logic with biomolecules R. Deaton & M. Garzon Soft Computing 5 (2001) pp. 2-9 Summarized by Shin, Soo-Yong 2001.8.3

(C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Abstract The uncertain and inexact nature of the chemical reactions used to implement DNA computation An advantage of implementing robust soft computing systems. Dependent on the actual geometry of the Gibbs free-energy landscapes in the space of all duplex formations. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Soft computing Fuzzy logic, neural networks, evolutionary computation (inspired by biological paradigms) Takes advantage of the uncertainty in the reactions, Hybridization process is inherently fuzzy! There is a degree of uncertainty Do not consider as “errors”. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Biomolecules A, G, C, T (U) DNA-to-DNA template matching (hybridization) A = T ; C  G Operations Gel electrophoresis : sorting & visualization Restriction enzymes : cut-and-paste PCR : copying (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Biomolecules Determine duplex stability. Nearest-neighbor model : focuses on consecutive base pairs, referred to as base stacks, for which thermodynamic data exists. mismatches (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Fuzzy Sets Everything is a matter of degree (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Membership functions (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/ If-then rules (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Fuzzy systems in biomolecules In general, hybridization is fuzzy! As temperature change, the degree of hybridization ca be changed. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/ DNA-based fuzzy sets Two choices The uncertainty of hybridization to represent fuzzy variables at the level of populations The uncertainty inherent in hybridization between individual strands The set of hybridized oligonucleotide pairs is a fuzzy set. A species of perfectly hybridized duplex would have all base pairs stacked, have a membership value of 1. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Fuzzy hybridization logic If-then rules (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Fuzzy hybridization logic Use DNA hybridization, free energy f formation of the duplex (G) And the technology of high-density arrays of DNA, or DNA chips (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Encoding membership functions DNA implementation of a membership function Free energy of formation of the DNA duplex, G Very important problems  encoding problems Membership function onto the sequences of the DNA molecules so that their values can be measured experimentally from the physical properties of the duplexes formed under appropriate reaction conditions. Simplest way : nearest-neighbor interationcs. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Encoding membership functions AA/TT AT/AT TA/TA AG/CT GA/TC AC/GT CA/TG GC/GC CG/CG GG/CC AE’/ET TE’/EA CE’/EG GE’/EC 14 nearest-neighbor paris NXY/YX : the number of occurrences of the complementary base pair in the molecules (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Encoding membership functions In general, a given molecules can be represented as a linear combination of the independent sequences si : the sequence xi : the number of occurrences of that sequence in the molecules (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Encoding membership functions (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Encoding membership functions Design molecules representing values of 0.2, 0.4, 0.6, 0.8, 1.0 (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Encoding membership functions The molecule representing a membership value of 0.2 EGTAAGGGCATCGE’ E’CATTCCCGTAGCE The representation of this duplex (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Encoding membership functions For the next molecules, the membership value is doubled, Take the first molecule and concatenate to it a new molecule that has identical composition, but a different sequences (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Encoding membership functions Inputs are encoded into a spectrum of DNA molecules, and might not be exact matches to the membership molecules 3’GCTGTAATCACGGTC5’ Encoding task is really important! (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

DNA-based fuzzy associative memory (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Conclusion More effective use of the properties inherent in DNA hybridization Makes fuzzy computing with DNA more tolerant to errors than conventional molecular computing Two problems Duplex stability calculation Encoding problems (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/