PPT ON DNA1

8/7/2019 PPT ON DNA1

1/52


2/52


3/52

Made By

ISHA SAXENA

&Kanika Jain


4/52

DNA Stands for Deoxi-ribonucleic acid.

It is the genetic material of each individual.

It contains instructions for assembling cells.

DNA is unique for each and every individual.

DNA Molecule

DNA Lab Chip


5/52

DNA strand

hth

yyh

yhy


6/52


7/52


8/52


9/52

Also known as MOLECULAR COMPUTING.

It uses DNA, molecular biology and bio chemistry.

It perform operations similar to computer by theuse of enzymes, catalyst etc.


10/52

Using a DNA-based celladhesion system, researcherscan create cell chips,

analogous to DNA chips, thatcould be used as biosensors fordetecting the presence of

pathogens, or for screeningpotential new therapeuticdrugs.


11/52


12/52

DNA HELIX

STRANDS

POLYMERASE

REACTIONS


13/52

MOTHERBOARD


14/52

DNA moleculearrangementin DNA chip.


15/52


16/52

Began in 1994 when Dr. Leonard

Adleman wrote the paper Molecularcomputation of solutions tocombinatorial problems.


17/52

DNA computers moved from test tubesonto gold plates.


18/52

First practical DNA computer unveiled in2002. Used in gene analysis.


19/52

Self-powered DNA computer unveiled

in 2003.

First programmable autonomous computingmachine.

Can perform a billion operations per secondwith 99.8% accuracy.


20/52

Biological computer developed that could be used tofight cancers.

Designer DNA identifies abnormal and is attracted

to it.

The Designer molecule then releases chemicals to

inhibit its growth or even kill the malignant cells.

Successfully tested on animals.


21/52

Feature DNA COMPUTER SILICON COMPUTER

Miniaturization Unlimited Limited

Processing Parallel Sequential

Speed Very fast Slower

Cost Cheaper Costly

Materialsused Non-toxic Toxic

Size Verysmall Large

Data capacity Very large Smaller


22/52

It utilizes the property of DNA.

It can solve parallel search problems efficiently.

Utilizing the DNA computing can solve theproblems more faster.

Father of DNA computing-

Leonard Adleman


23/52

It shows I gm of DNA andCD holds 800 MB of data.

1 gm of DNA = 1*10^14 MB ofdata.


24/52

LEONARD ALDEMAN SOLVED THEHAMILTONIAN PATH PROBLEM.

PROBLEM WAS- TO FIND THESHORTEST PATH BETWEEN CITIES &VISITING EACH CITYEXACTLYONCE.


25/52

Given a graph with n vertices

1. Generate a set of random paths

2. For each path in the set

a. Check whether that path starts at the startvertex and ends with the end vertex

b. Check if that path passes through n vertices

c.Check if that path passes through that verte

x

3. If the set is not empty, there is a Hamiltonianpath


26/52


27/52

Hamilton Path Problem(also known as the travelling salespersonproblem)

Is there any Hamiltonian path from Darwin toAlice Spring?

PERTH

BRISBANE

SYDNEY

ALICESPRING

DARWIN

MELBOURNE


28/52

Within a few seconds, all of the possiblecombinations of DNA strands, which represent

answers, are created in the test tube.

Adleman eliminates the wrong molecules

through chemical reactions, which leavesbehind only the flight paths that connect all

7 cities.


29/52

Solution by inspection is:

Darwin -> Brisbane -> Sydney -> Melbourne ->Perth->Alice Spring

BUT, there is no deterministic solution to this

problem, i.e. we must check all possiblecombinations.

DARWIN

PERTH

SYDNEY

MELBOURNE

ALICESPRING

BRISBANE


30/52

Encode each city with complementary base vertex molecules

Sydney - TTAAGGPerth - AAAGGG

Melbourne - GATACT

Brisbane - CGGTGCAlice Spring CGTCCA

Darwin - CCGATG


31/52

Encode all possible paths using the

complementary base edge molecules:

Sydney -> Melbourne AGGGAT

Melbourne-> Sydney ACTTTA

Melbourne -> Perth ACTGGGetc


32/52

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

to form a long chains of DNA molecules.

Solution withvertex DNAmolecules

Solution withedge DNAmolecules

MERGE

&ANNEAL

Long chains ofDNA molecules(All possible pathexists in the graph)


33/52

The solution is a double helix molecule:

DARWIN BRISBANE SYDNEY MELBOURNE PERTH ALICE SPRING

CCGATG CGGTGC TTAAGG-GATACT AAAGGG -CGTCCA

TACGCC - ACGAAT - TCCCTA - TGATTT - CCCGCA

DARWIN BRISBANE SYDNEY MELBOURNE PERTH

->BRISBANE ->SYDNEY ->MELBOURNE ->PERTH ->ALICE

SPRING


34/52

They detect fragments of genetic material as input,splice together these fragments and form a singleoutput.

For instance, a genetic gate called the "And gate"links two DNA inputs by chemically binding themso they're locked in an end-to-end structure.

Logic gates might be combined with DNAmicrochips to create a breakthrough in DNAcomputing


35/52

DNA can be used to calculate complex mathematicalproblems.

University of Rochester developed logic gates made of DNA.

Currently, logic gates interpret input signals from silicontransistors, and convert those signals into an output signalthat allows the computer to perform complex functions.

Logic gates made up DNA instead of using electrical

signals to perform logical, rely on DNA code.


36/52

He showed that DNA can be used to solve hard

computational problem

The power of DNA in view of

computation capability:vast parallelism

exceptional energy efficiency

extraordinary information density


37/52

MELTING

ANNEALING

MERGING

AMPLIFICATION

SELECTION


38/52

Given a test tube T & Astrand S, it is possible toextract all the possible

strands in T that containS as subsequence & toseparate them fromthose that do not containit.

Formation ofa DNA Strand


39/52

Precipitation of more

DNA Strands in alcohol.


40/52

Spooling a DNA

with a metal hook orsimilar device.


41/52

Taiwan introduced the world's first DNAauthentication chip.

The first DNA chip in the world has finally beendeveloped by Biowell Technology Inc. after 2 years ofresearch.

Inside the chip is synthesized DNA, which can beidentified by a device similar to an identificationcard or a credit card reader.


42/52

The synthesized DNA inside the chip generatesDNA signals which only the company's readerscan detect and authenticate in two seconds.

The DNA chip can also be used on passports,credit cards, membership cards, licenses, CDs,DVDs, notebooks, PDAs , computer softwareetc..


43/52

US team shows that DNA computingcan be simplified by attaching themolecules to a surface.

DNA molecules were applied to asmall glass plate overlaid with gold.

Exposure to certain enzymes,

destroyed the molecules with wronganswers leaving only the DNA withthe right answers.


44/52

Perform millions of operations simultaneously.

Conduct large parallel processing .

Massive amounts of working memory.

Generate & use own energy source via the input.

F

our storage bits AT

G C .Miniaturization of data storage.


45/52

DNA computing involves a relatively largeamount of error.

Requires human assistance.

Time consuming laboratory procedures.

No universal method of datarepresentation.


46/52

DNA chips.

Genetic programming.

Pharmaceutical applications.

Cracking of coded messages.


47/52

Mapping the problem to DNA and DNAoperations.

Extracting the answer takes time.

Large problems may not fit into test tube.

Suited for specific problems, difficult togeneralize


48/52

Error: Molecular operations are not perfect.

Reversible and Irreversible Error.

Efficiency: How many molecules contribute?

Encoding problem in molecules is difficult.

Scaling to larger problems.


49/52

o DNA computers showing enormous potential,especially for medical purposes as well as dataprocessing applications.

o Many issues to be overcome to produce a usefulDNA computer.

o Still a lot of work and resources required todevelop it into a fully fledged product.


50/52

Cross-fertilization among evolutionary computing,DNA computing, molecular biology, and computationbiology.

Niche uses of DNA computers for problems that aredifficult for electronic computers.

Increased movement into exploring the connection

between life and computation.


51/52

Adleman used the Traveling Salesman problem wassimple. As technology becomes more refined, more

efficient algorithms may be discovered.

In future advances may make DNA computers moreefficient.

The University of Wisconsin is experimenting with chip-based DNA computers.

Instead, their powerful computing power will be used forareas of encryption, genetic programming, language

systems, and algorithms or by airlines wanting to mapmore efficient routes. Hence better applicable in onlysome promising areas.


52/52

ANY QUERIES?

It will take years to develop a practical workable DNAcomputer.

But. Lets hope that the DREAM come true.

Date post:	08-Apr-2018
Category:	Documents
Upload:	ishasaxena
View:	222 times
Download:	0 times

PPT ON DNA1

Documents