M. Sakthi Balan Kamala Krithivasan Theoretical Computer Science Lab

Slides:



Advertisements
Similar presentations
1 Lecture 12: Hardware for Arithmetic Today’s topics:  Designing an ALU  Carry-lookahead adder Reminder: Assignment 5 will be posted in a couple of days.
Advertisements

Lab 10 : Arithmetic Systems : Adder System Layout: Slide #2 Slide #3 Slide #4 Slide #5 Arithmetic Overflow: 2’s Complement Conversions: 8 Bit Adder/Subtractor.
Some Characteristics of Spiking Neural P Systems with Anti-Spikes Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of.
ECE C03 Lecture 61 Lecture 6 Arithmetic Logic Circuits Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Design of Arithmetic Circuits – Adders, Subtractors, BCD adders
Data Representation in Computers. Data Representation in Computers/Session 3 / 2 of 33 Number systems  The additive approach – Number earlier consisted.
Binary Addition Addition Rules: = = = = = carry 1 1 carry 1 Example 1: Example 2:
BINARY ARITHMETIC Binary arithmetic is essential in all digital computers and in many other types of digital systems.
3-1 Chapter 3 - Arithmetic Principles of Computer Architecture by M. Murdocca and V. Heuring © 1999 M. Murdocca and V. Heuring Principles of Computer Architecture.
Basic Arithmetic (adding and subtracting)
Beyond Silicon: Tackling the Unsolvable with DNA.
Logic Design Dr. Yosry A. Azzam. Binary systems Chapter 1.
Basic Arithmetic (adding and subtracting)
High Performance Circuit Design By Prof. V. Kamakoti Department of Computer Science and Engineering Indian Institute of Technology, Madras Chennai – 600.
New Mexico Computer Science for All Author: Ed Angel Title: Bits and Bytes.
6 October 2015Birkbeck College, U. London1 Introduction to Computer Systems Lecturer: Steve Maybank Department of Computer Science and Information Systems.
By Jariya Phongsai A two's-complement system is a system in which negative numbers are represented by the two's complement of the absolute value; this.
ARITHMETIC MICRO OPERATIONS
EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 8 Arithmetic.
08 ARTH Page 1 ECEn/CS 224 Number Representation and Binary Arithmetic.
Binary Arithmetic for DNA Computers R. Barua and J. Misra Preliminary Proceedings of the Eighth International Meeting on DNA Based Computers, pp ,
(C) 2002, SNU Biointelligence Lab, Strategies for the development of a peptide computer Hubert Hug and Rainer Schuler Bioinformatics,
In decimal we are quite familiar with placing a “-” sign in front of a number to denote that it is negative The same is true for binary numbers a computer.
Lecture #23: Arithmetic Circuits-1 Arithmetic Circuits (Part I) Randy H. Katz University of California, Berkeley Fall 2005.
1 CS 151 : Digital Design Chapter 4: Arithmetic Functions and Circuits 4-3 : Binary Subtraction.
August 18, 2015 Bell Work:  What is the purpose of DNA replication? Objective: The student will be able to… 1. Demonstrate his or her knowledge of DNA.
Binary Values. Numbers Natural Numbers Zero and any number obtained by repeatedly adding one to it. Examples: 100, 0, 45645, 32 Negative Numbers.
Computer Arthmetic Chapter Four P&H.
Chapter Contents 3.1 Overview 3.2 Fixed Point Addition and Subtraction
Computational Models using Peptide-Antibody Interactions
Prof. Sin-Min Lee Department of Computer Science
Algorithms for a Peptide Computer
Negative Binary Numbers
Chapter 02 Nell Dale & John Lewis.
Things that may help with comprehension of bioinformatics issues in general and Rosalind problems in particular.
Homework Reading Machine Projects Labs
Peptide Computing – Universality and Complexity
Negative Binary Numbers
Digital Systems Section 8 Multiplexers. Digital Systems Section 8 Multiplexers.
Register Transfer and Microoperations
University of Gujrat Department of Computer Science
CSE Winter 2001 – Arithmetic Unit - 1
King Fahd University of Petroleum and Minerals
Arithmetic Circuits (Part I) Randy H
Systems Architecture I
KEY CONCEPT DNA structure is the same in all organisms.
UNIVERSITY OF MASSACHUSETTS Dept
Instructor: Alexander Stoytchev
ME 4447/6405 Microprocessor Control of Manufacturing Systems and
Instructor: Alexander Stoytchev
Digital Systems Section 12 Binary Adders. Digital Systems Section 12 Binary Adders.
Unit 18: Computational Thinking
CS 140 Lecture 14 Standard Combinational Modules
Homework Reading Machine Projects Labs
Overview Part 1 – Design Procedure Part 2 – Combinational Logic
DNA-based Parallel Computation of Simple Arithmetic
ME 4447/6405 Microprocessor Control of Manufacturing Systems and
CSE 140 Lecture 14 Standard Combinational Modules
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
Binary to Decimal Conversion
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
Arithmetic Logic Unit A.R. Hurson Electrical and Computer Engineering Missouri University of Science & Technology A.R. Hurson.
Arithmetic Circuits.
CSC 220: Computer Organization Signed Number Representation
Information and Computer Security CPIS 312 Lab 4 & 5
Computer Architecture
Presentation transcript:

Parallel Computation of Simple Arithmetic using Peptide-Antibody Interactions M. Sakthi Balan Kamala Krithivasan Theoretical Computer Science Lab Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai – 600036. Email: sakthi@cs.iitm.ernet.in kamala@iitm.ernet.in TCS Lab, IITM

Organization DNA Computing Peptide Computing Proposed Model Addition Algorithm Subtraction Algorithm Discussion TCS Lab, IITM

DNA Computing Uses DNA strands and Watson-Crick Complementarity as operation Highly non-deterministic Massive parallelism Solves NP-Complete Problems quite efficiently TCS Lab, IITM

Peptide Computing Uses peptides and antibodies Operation – binding of antibodies to epitopes in peptides Epitope – The site in peptide recognized by antibody Highly non-deterministic Massive parallelism TCS Lab, IITM

Peptide Computing Contd.. Peptides – sequence of amino acids Twenty amino acids. Example – Glycine, Valine Connected by covalent bonds TCS Lab, IITM

Peptide Computing Contd.. Antibodies recognizes epitopes by binding to it Binding of antibodies to epitopes has associated power called affinity Higher priority to the antibody with larger affinity power TCS Lab, IITM

Computing DNA Vs Peptide Twenty building blocks (20 amino acids) Example: Glycine, Valine Different antibodies can recognize different epitopes Binding affinity of antibodies can be different Four building blocks Adenine (A), Guanine(G), Cytosine (C), Thiamine (T) Only one reverse complement – Watson-Crick Complement Complement (A) = T and Complement (G) = C TCS Lab, IITM

Proposed Model Consists of a peptide and set of antibodies Peptide sequence has n position specific epitopes Epitopes epi = yi xi zi, yi and zi are switching epitopes for the ith bit. TCS Lab, IITM

Peptide Sequence for a 5-bit number y4 x4 z4 y0 x0 z0 Peptide Sequence for a 5-bit number TCS Lab, IITM

Antibodies A = {A0, A1, …, An-1} B = {B0, B1, …, Bn-1} TAB = {TAB0, TAB1, …, TAB(n-1)} TBA = {TBA0, TBA1, …, TBA(n-1)} TCS Lab, IITM

Binding Sites xizi yixi For Bi For Ai xi xi xizi > xi yixi > xi TABi Zi TBAi yi TCS Lab, IITM

Affinity aff(TABi) > aff(Ai) aff(TBAi) > aff(Bi) aff(TABi) = aff(TBAi) TCS Lab, IITM

What it denotes? Ai – denotes ith bit is zero Bi – denotes ith bit is one TABi – used to switch ith bit from zero to one TBAi – used to switch ith bit from one to zero TCS Lab, IITM

Representation of Binary Numbers If the ith bit is 0 then the antibody Ai is bounded to the epitope yixi If the ith bit is 1 then the antibody Bi is bounded to the epitope xizi TCS Lab, IITM

Example B4 A3 B2 A1 B0 10101 TCS Lab, IITM

Addition of Two Binary Numbers A = an-1an-2 …a0 B = bn-1bn-2 …b0 C = cn cn-1cn-2 …c0 TCS Lab, IITM

XOR ai bi ci 1 2 3 4 TCS Lab, IITM

Addition (Contd..) First step – guessing equivalent to XOR gate. The bit cn is initialized to zero. Carry propagation. TCS Lab, IITM

Addition (Contd..) Carry occurs only when both the bits ai and bi are 1. Carry is propagated to the left until both the bits aj and bj(j > i) are 0. If no such j exists then propagation stops making nth bit 1. j.j-1….i+1 is called the carry block. For each carry block j.j-1….i+1 invert the digits ck (i+1  k  j) TCS Lab, IITM

Algorithm Add antibodies Ai where ai = 0 and bi = 0 or ai = 1 and bi = 1. Add antibodies Bi where ai = 0 and bi = 1 or ai = 1 and bi = 0. For all carry block jkjk-1…ik+1 do the following in parallel. For ik +1  s  jk Add antibodies TABs, Add antibodies Bs, Add antibodies TBAs, and Add antibodies As. TCS Lab, IITM

Example 10110 10011 + 000101 A5 A4 A3 B2 A1 B0 TCS Lab, IITM

Example (Contd..) 101101 B5 A4 B3 B2 A1 B0 TCS Lab, IITM

Example (Contd..) 101001 B5 A4 B3 A2 A1 B0 TCS Lab, IITM

Algorithm ADD(A,B,C) XOR(A,B,C) BlockInversion(I1,I2,…Ik,C) where Ij are carry blocks and k is the number of carry blocks. TCS Lab, IITM

Algorithm - Same(C) Add excess of epitopes yi Add antibodies Ai To get the peptide sequence with antibodies in workable form Add excess of epitopes yi Add antibodies Ai Add excess of eptiopes zi Add antibodies Bi TCS Lab, IITM

Algorithm - Subtraction SUB(A,B,C) BlockInversion(I1,, B, B’) where I1 = n-1…0 ADD(B’, ONE, B’’) where ONE = an-1an-2…a11, ai = 0 ADD(A, B’’, C) Inverttozero(C,n) TCS Lab, IITM

Algorithm – Inverttozero Inverttozero(C,i) Same(C) Add antibody TABi Add antibody Ai TCS Lab, IITM

Discussion To extract numbers from this system Limitations NMR can be used or X-ray crystallography Limitations Obtaining monoclonal antibodies Manual process Implementation ? Universal operations ? TCS Lab, IITM

Acknowledgments Authors thank Saravanakumar Narayanan, TU-Munchen, Germany for helpful discussions TCS Lab, IITM

“They were built by 3 billion years of evolution, and we’re just beginning to tap their potential to serve non-biological purposes. Nature has given us an incredible toolbox, and we’re starting to explore what we might build” Leonard Adleman Thank You TCS Lab, IITM