Stochastic Computing with Biomolecular Automata R. Adar, Y. Benenson, G. Linshiz, A. Rosner, N. Tishby, and E. Shapiro PNAS, vol. 101, no. 27, pp. 9960-9965,

Slides:



Advertisements
Similar presentations
Automata Theory Part 1: Introduction & NFA November 2002.
Advertisements

Knowledge Based Synthesis of Control for Distributed Systems Doron Peled.
Molecular Computing Machine Uses its Input as Fuel Kobi Benenson Joint work with Rivka Adar, Tamar Paz-Elizur, Zvi Livneh and Ehud Shapiro Department of.
T h e G a s L a w s. T H E G A S L A W S z B o y l e ‘ s L a w z D a l t o n ‘ s L a w z C h a r l e s ‘ L a w z T h e C o m b i n e d G a s L a w z B.
Biointelligence Lab School of Computer Sci. & Eng. Seoul National University Artificial Intelligence Chapter 8 Uninformed Search.
Machine Learning Hidden Markov Model Darshana Pathak University of North Carolina at Chapel Hill Research Seminar – November 14, 2012.
Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.
1 3. Spiking neurons and response variability Lecture Notes on Brain and Computation Byoung-Tak Zhang Biointelligence Laboratory School of Computer Science.
Introduction to Computability Theory
1 Introduction to Computability Theory Lecture2: Non Deterministic Finite Automata Prof. Amos Israeli.
Hidden Markov Models Pairwise Alignments. Hidden Markov Models Finite state automata with multiple states as a convenient description of complex dynamic.
1 Introduction to Computability Theory Lecture2: Non Deterministic Finite Automata (cont.) Prof. Amos Israeli.
Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.
Aho-Corasick String Matching An Efficient String Matching.
(C) 2001 SNU CSE Biointelligence Lab Incremental Classification Using Tree- Based Sampling for Large Data H. Yoon, K. Alsabti, and S. Ranka Instance Selection.
Chapter 8. Linear Systems with Random Inputs 1 0. Introduction 1. Linear system fundamentals 2. Random signal response of linear systems Spectral.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Analysis of software reliability and performance.
Is DNA Computing Viable for 3-SAT Problems? Dafa Li Theoretical Computer Science, vol. 290, no. 3, pp , January Cho, Dong-Yeon.
Stochastic DAG Scheduling using Monte Carlo Approach Heterogeneous Computing Workshop (at IPDPS) 2012 Extended version: Elsevier JPDC (accepted July 2013,
Stochastic Computing with Biomolecular Automata Advanced Artificial Intelligence Cho, Sung Bum.
A Realization of Information Gate by Using Enterococcus faecalis Pheromone System Kenichi Wakabayashi and Masayuki Yamamura Preliminary Proceedings of.
An autonomous molecular computer for logical control of gene expression Yaakov Benenson, Binyamin Gil, Uri Ben-Dor, Rivka Adar & Ehud Shapiro Weizmann.
Copyright (c) 2002 by SNU CSE Biointelligence Lab 1 Chap. 4 Pairwise alignment using HMMs Biointelligence Laboratory School of Computer Sci. & Eng. Seoul.
Artificial Intelligence Project #3 : Diagnosis Using Bayesian Networks May 19, 2005.
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.
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
Bayesian Brain: Probabilistic Approaches to Neural Coding Chapter 12: Optimal Control Theory Kenju Doya, Shin Ishii, Alexandre Pouget, and Rajesh P.N.Rao.
Binary Arithmetic for DNA Computers R. Barua and J. Misra Preliminary Proceedings of the Eighth International Meeting on DNA Based Computers, pp ,
6.4 Random Fields on Graphs 6.5 Random Fields Models In “Adaptive Cooperative Systems” Summarized by Ho-Sik Seok.
Chapter 13. How to build an imitator in Imitation and Social Learning in Robots, Humans and Animals Course: Robots Learning from Humans Park, Susang
Chapter 14. Active Vision for Goal-Oriented Humanoid Robot Walking (2/2) in Creating Brain-Like Intelligence, Sendhoff et al. Course: Robots Learning from.
About Alternating Automata Daniel Choi Provable Software Laboratory KAIST.
HMP Simulation - Introduction Deterministic vs. Stochastic Models Risk Analysis Random Variables Best Case/Worst Case Analysis What-If Analysis.
Symbolic Regression via Genetic Programming AI Project #2 Biointelligence lab Cho, Dong-Yeon
A nanoscale programmable computing machine with input, output, software and hardware made of biomolecules Nature 414, (2001) Kobi Benenson supervisor:
Chapter 4. Analysis of Brain-Like Structures and Dynamics (2/2) Creating Brain-Like Intelligence, Sendhoff et al. Course: Robots Learning from Humans 09/25.
Information Bottleneck Method & Double Clustering + α Summarized by Byoung Hee, Kim.
Business Modeling Lecturer: Ing. Martina Hanová, PhD.
Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability Primer Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability.
Artificial Intelligence Chapter 7 Agents That Plan Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Biointelligence Lab School of Computer Sci. & Eng. Seoul National University Artificial Intelligence Chapter 8 Uninformed Search.
Molecular Evolutionary Computing (MEC) for Maximum Clique Problems March 9, 2004 Biointelligence Laboratory School of Computer Science and Engineering.
Ch 1. Introduction Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by J.W. Ha Biointelligence Laboratory, Seoul National University.
Introduction to Automata Theory Theory of Computation Lecture 5 Tasneem Ghnaimat.
Ch 2. The Probably Approximately Correct Model and the VC Theorem 2.3 The Computational Nature of Language Learning and Evolution, Partha Niyogi, 2004.
Theory of Computation Automata Theory Dr. Ayman Srour.
Chapter 9. A Model of Cultural Evolution and Its Application to Language From “The Computational Nature of Language Learning and Evolution” Summarized.
Bayesian Brain - Chapter 11 Neural Models of Bayesian Belief Propagation Rajesh P.N. Rao Summary by B.-H. Kim Biointelligence Lab School of.
Dimension Review Many of the geometric structures generated by chaotic map or differential dynamic systems are extremely complex. Fractal : hard to define.
Stochastic Fluctuations of the Synaptic Function
Horn Clause Computation with DNA Molecules
DNA-Based Computation Times
Rational Decisions and
SMEM Algorithm for Mixture Models
CSE322 Definition and description of finite Automata
Summarized by In-Hee Lee
Finite Automata.
UNIT 5. Linear Systems with Random Inputs
DNA-based Parallel Computation of Simple Arithmetic
Operation of a Purified DNA nanoactuator
Biointelligence Lab School of Computer Sci. & Eng.
A Classification Data Set for PLM
Artificial Intelligence Chapter 8 Uninformed Search
Adaptive Cooperative Systems Chapter 6 Markov Random Fields
S. Kikuchi, D. Tominaga, M. Arita, K. Takahashi, and M. Tomita
Artificial Intelligence Chapter 7 Agents That Plan
Parallel BFS for Maximum Clique Problems
Non Deterministic Automata
Universal Biochip Readout of Directed Hamiltonian Path Problems
Presentation transcript:

Stochastic Computing with Biomolecular Automata R. Adar, Y. Benenson, G. Linshiz, A. Rosner, N. Tishby, and E. Shapiro PNAS, vol. 101, no. 27, pp , July Cho, Dong-Yeon

© 2004 SNU CSE Biointelligence Lab 2 Introduction Stochastic Computing  The choice between several alternative computation paths (each with a prescribed probability)  Random number generator  Biomolecular computer  A stochastic biomolecular computer would be more suitable for this biomedical tasks than a deterministic one. A Design Principle for Stochastic Computers

© 2004 SNU CSE Biointelligence Lab 3 Deterministic and Stochastic Finite Automata

© 2004 SNU CSE Biointelligence Lab 4 Previous Work

© 2004 SNU CSE Biointelligence Lab 5 Results (1/6) Calibration  We performed calibration with the four-symbol inputs aaab and bbba.  Computation trees used for the calibration of transition probabilities

© 2004 SNU CSE Biointelligence Lab 6 Results (2/6)  To determine the function mapping relative concentrations of transition molecules to transition probabilities  Transitions processing the symbol a provide a linear mapping.  Transitions processing b reveal a convex mapping.  This is apparently caused by the software molecules that result in state S1 (T4 and T8) having a higher reaction rate than the competing software molecules that result in state S0 (T3 and T7).

© 2004 SNU CSE Biointelligence Lab 7 Results (3/6)  To verify that the system is insensitive to fluctuations in input concentration  Using the input bbba and T1-T2 transition pair  The computation is insensitive to the different input concentrations used and the transition probability is determined solely by the ration between the transition molecules.

© 2004 SNU CSE Biointelligence Lab 8 Results (4/6)  Sensitivity of the probability distribution to the absolute concentration of the software molecules  The transition probability is indeed relatively insensitive to the absolute software concentrations and is defined mostly by the relative concentration ratio.

© 2004 SNU CSE Biointelligence Lab 9 Results (5/6) Running 4 Programs with 9 Inputs bbba, aaab, abbbbbba, babbaaab, baaaaaab, babbabbbbbba, baaaabbbbbba, abbbbabbaaab, abbbbaaaaaab

© 2004 SNU CSE Biointelligence Lab 10 Results (6/6)

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.