dna based employee recognition

8/2/2019 Dna Based Employee Recognition

1/32

DNA BASED EMPLOYEE

RECOGNITION

BY,

Rahul.R,

Adith.N.S,

Ashwin Deepu,Priyanka .E.Nair

S8 CS,

MBCET


2/32

Introduction to DNA:

The lifes molecule:


3/32

Introduction:

What is DNA computing ?

Around 1950 first idea (precursor Feynman)

First important experiment 1994: Leonard Adleman

Molecular level (just greater than 10-9 meter)

Massive parallelism.

In a liter of water, with only 5 grams of DNA we getaround 1021 bases !

Each DNA strand represents a processor !


4/32

What is DNA?

DNA stands for Deoxyribonucleic Acid

DNA represents the genetic blueprint of living

creatures

DNA contains instructions for assembling

cells

Every cell in human body has a complete setof DNA

DNA is unique for each individual


5/32

A bit of biology The DNA is a double stranded molecule.

Each strand is based on 4 bases: Adenine (A)

Thymine (T)

Cytosine (C)

Guanine (G) Those bases are linked through a sugar (desoxyribose)

IMPORTANT: The linkage between bases has a direction.

There are complementarities between bases (Watson-Crick).

(A) (T)

(C)(G)


6/32

Double Helix

Sides

Sugar-phosphate backbones

ladders

complementary base pairs

Adenine & Thymine

Guanine & Cytosine

Two strands are held together by

weak hydrogen bonds between the

complementary base pairs

Source: Human Physiology: From Cells to System

4th Ed., L. Sherwood, Brooks/Cole, 2001, C-3


7/32

Instructions in DNA

Instructions are codedin a sequence of the DNA

bases

A segment of DNA is exposed, transcribed and

translated to carry out instructions

Sequence to indicate thestart of an instruction

Instruction that triggersHormone injection

Instruction for hair cells


8/32

DNA/CPU COMPARISON

CPU

Sequential Operations

addition, bit-shifting, logical operations (AND, OR,NOT, NOR)

DNA

Parallel Operations

Cut, Copy, Paste, Repair


9/32

Can DNA Compute?

DNA itself does not carry out any computation.

It rather acts as a massive memory.

BUT, the way complementary bases react with

each other can be used to compute things.

Proposed by Adelman in 1994


10/32


11/32

Ligases

Bind molecules together

Concatenates DNA strands


12/32

Polymerase

Copies DNA

Primers (Start, Complement of End)

PCR


13/32

Gel Electrophoresis

Sort molecules by length

Molecules have a charge

Magnets used


14/32

And what now ?

Situation:

Molecular level.

Lots of agents. (strands)

Tools provided by nature. (enzymes)

How can we use all this? If there is a utility


15/32

Leonard M. Adleman

Background in Mathematics & ComputerScience

HIV Research

DNA/Turing Machine similar

Proof of Concept


16/32

Coding the information:

1994: THE Adlemans experiment.

Given a directedgraph can we find anhamiltonian path (more complex than the TSP).

In this experiment there are 2 keywords:

massive parallelism(all possibilities are generated)

complementarity(to encode the information) This experiment proved that DNA computing wasnt just a theoretical study

but could be applied to real problems like cryptanalysis (breaking DES ).


17/32

Adlemans Experiment

Hamilton Path Problem(also known as the travelling salesperson problem)

Perth

Darwin

Brisbane

Sydney

Melbourne

Alice Spring

Is there any Hamiltonian path from Darwin to Alice Spring?


18/32

Adlemans Experiment (Contd)

Solution by inspection is:Darwin Brisbane SydneyMelbourne Perth

Alice Spring

BUT, there is no deterministic solution to thisproblem, i.e. we must check all possible

combinations.

Perth

Darwin

Brisbane

Sydney

Melbourne

Alice Spring


19/32


1. Encode each city with complementary base -

vertex moleculesSydney - TTAAGG

Perth - AAAGGGMelbourne - GATACT

Brisbane - CGGTGC

Alice SpringCGTCCA

Darwin - CCGATG


20/32


2. Encode all possible paths using the

complementary baseedge moleculesSydneyMelbourneAGGGAT

Melbourne SydneyACTTTAMelbourne PerthACTGGG

etc


21/32

Recipe

In a test tube add

10^14 molecules of each city

10^14 molecules of each flight

Water, ligase, salt

Answer generated in about one second

100 trillion molecules representing wronganswers also generated


22/32


3. Marge vertex molecules and edge molecules.All complementary base will adhere to each other to

form a long chains of DNA molecules

Solution with

vertex DNA

molecules

Solution with

edge DNA

molecules

Marge

&

Anneal

Long chains of DNA molecules (All

possible paths exist in the graph)


23/32


The solution is a double helix molecule:

CCGATG CGGTGC TTAAGG GATACT AAAGGG CGTCCA

TACGCC ACGAAT TCCCTA TGATTT CCCGCA

Darwin Brisbane Sydney Melbourne Perth Alice Spring

DarwinBrisbane

BrisbaneSydney

SydneyMelbourne

MelbournePerth

PerthAlice Spring


24/32

Operations

Meltingbreaking the weak hydrogen bonds in a double helix

to form two DNA strands which are complement to

each other

Annealingreconnecting the hydrogen bonds between

complementary DNA strands


25/32

Operations (Contd)

Mergingmixing two test tubes with many DNA molecules

AmplificationDNA replication to make many copies of the original

DNA molecules

Selection

elimination of errors (e.g. mutations) and selection ofcorrect DNA molecules


26/32

Pros and Cons

+ Massively parallel processor

DNA computers are very good to solve Non-

deterministic Polynomial problems such as

DNA analysis and code cracking.

+ Small in size and power consumption


27/32

Pros and Cons (Contd)

- Requires constant supply of proteins and

enzymes which are expensive

- Errors occur frequently

a complex selection mechanism is required and

errors increase the amount of DNA solutions

needed to compute

- Application specific

- Manual intervention by human is required


28/32

Why dont we see DNA computers

everywhere?

DNA computing has wonderful possibilities:

Reducing the time of computations* (parallelism)

Dynamic programming !

However one important issue is to find thekiller application.

Great hurdles to overcome


29/32

Some hurdles:

Operations done manually in the

lab.

Natural tools are what they are

Formation of a library (statistic way)

Operations problems


30/32

Conclusion

Many issues to be overcome to produce a

useful DNA computer.

It will not replace the current computers

because it is application specific, but has a

potential to replace the high-end research

oriented computers in future.

Nanotechnology?


31/32

Bibliography:

DNA Computing, New Computing

Paradigms. Gheorghe Paun,Grzegorz Rozenberg,Arto Salomaa

DIMACS: DNA based computers

Reducing Errors in DNA Computing

by Appropriate Word Design.wdesign.pdf


32/32
http://www.intermonde.net/adn/liens.htmlhttp://dna2z.com/dnacpu/dna.htmlhttp://www.cs.wayne.edu/~kjz/KPZ/NaturalComputing.htmlhttp://www.cs.wayne.edu/~kjz/KPZ/NaturalComputing.html

dna based employee recognition

Documents