molecular computing
DESCRIPTION
Molecular Computing. [email protected] 3-41 Athabasca Hall Sept. 30, 2013. What Was The World’s First Computer?. The World’s First Computer?. Babbage Analytical Engine - 1837. ENIAC - 1946. Human Brain – 1,000,000 BP. Antikythera Mechanism - 80 BP. The World’s First Computer?. - PowerPoint PPT PresentationTRANSCRIPT
![Page 2: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/2.jpg)
What Was The World’s First Computer?
![Page 3: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/3.jpg)
The World’s First Computer?
ENIAC - 1946 Babbage Analytical Engine - 1837
Human Brain – 1,000,000 BPAntikythera Mechanism - 80 BP
![Page 4: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/4.jpg)
The World’s First Computer?
The Cell – 2,000,000,000 BP
![Page 5: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/5.jpg)
Cells versus Computers
Cell Computer
![Page 6: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/6.jpg)
21,000
metabolite
![Page 7: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/7.jpg)
Cells versus Computers• Base-4 (ACGT)• DNA• Bases• Codons• Genetic Code• Gene/Protein• Chromosome• Genome Size
• Base-2 (101010)• Magnetic tape/Disk• Bits/Transistors• Bytes• Instruction Set• Program• Hard Disk• Disk Capacity
![Page 8: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/8.jpg)
Data Storage
Cell Computer
![Page 9: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/9.jpg)
On/Off Signals
Cell Computer
![Page 10: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/10.jpg)
The Instruction Set
Cell Computer
0010011000000001101010101110110100100110
![Page 11: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/11.jpg)
Data Transcription
Computer
Cell
![Page 12: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/12.jpg)
Data Processing
Computer
Cell
![Page 13: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/13.jpg)
Data Interpretation
Cell Computer
If light=red then turn north else continue
![Page 14: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/14.jpg)
World’s Most Sophisticated Computer Language
AUGGUCACU (UAG) UCUGAAGUCA GCUA
CUAGGGA
CUUAUGCAUUCGUAU
A program that codes for a self-assemblingmolecular machine
![Page 15: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/15.jpg)
Key Differences...• Cells use chemicals for information storage and
transfer while computers use magnetic or electronic means
• In cells, proteins act as both programs and machines. In computers, programs and machines are separate with programs generally running the machines
• Proteins contain instructions for self-assembly, computers don’t
![Page 16: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/16.jpg)
DNA Computing
011001101010001 ATGCTCGAAGCT
![Page 17: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/17.jpg)
The First Turing Machine**
DNA Polymerase
A Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules.
![Page 18: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/18.jpg)
Computing With DNA
![Page 19: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/19.jpg)
Leonard Adleman**• Mathematician, computer scientist, boxer• Specialized in cryptography (RSA, 1983)• Invented the term computer virus (1984)• Became intrigued by “real” viruses (HIV)• Published a paper on HIV in 1993 and decided to
learn molecular biology• Came up with DNA computing (1994) while
studying “Molecular Biology of the Gene”• Member of NAS, won Turing prize in 2002
![Page 20: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/20.jpg)
Traveling Salesman Problem(7 cities, 14 air routes)
A salesman must find his way from city 0 to city 6, passing through each of the remaining cities only once7 nodes, 14 edges – Correct path is marked in red
![Page 21: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/21.jpg)
The Algorithm• Generate Random paths through graph G• From all paths created in step 1, keep only
those that start at 0 and end at 6• From all remaining paths, keep only those that
visit exactly 7 vertices• From all remaining paths, keep only those that
visit each vertex at least once• If any path remains, return“yes”;otherwise,
return “no”
![Page 22: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/22.jpg)
Represent Each City By A DNA Strand of 20 Bases
ATGCTCAGCTACTATAGCGA
TGCGATGTACTAGCATATAT
GCATATGGTACACTGTACAA
TTATTAGCGTGCGGCCTATG
CCGCGATAGTCTAGATTTCC
Etc.
City 1
City 2
City 3
City 4
City 5
![Page 23: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/23.jpg)
Represent Each Air Route By Mixed Complementary Strands
TGATATCGCTACGCTACATG
ATCGTATATACGTATACCAT
GTGACATGTTAATAATCGCA
CGCCGGATACGGCGCTATCA
GATCTAAAGGTATGCATACG
Etc.
City 1 2
City 2 3
City 3 4
City 4 5
City 5 6
![Page 24: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/24.jpg)
Connector DNA Links City DNA
TGATATCGCTACGCTACATG
ATCGTATATACGTATACCAT
GTGACATGTTAATAATCGCA
CGCCGGATACGGCGCTATCA
GATCTAAAGGTATGCATACG
ATGCTCAGCTACTATAGCGATGCGATGTACTAGCATATAT
TGCGATGTACTAGCATATATGCATATGGTACACTGTACAA
GCATATGGTACACTGTACAATTATTAGCGTGCGGCCTATG
TTATTAGCGTGCGGCCTATGCCGCGATAGTCTAGATTTCC
CCGCGATAGTCTAGATTTCCATACGTATGCTAGGCTATCG
![Page 25: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/25.jpg)
Anneal and Ligate DNA
Mix the City DNA with the Path DNA and let them randomly anneal (ligate with enzyme)After annealing/ligation they will form (7-2)! different long (150 bp) DNA moleculesSelect DNA molecules with the right start and ends (select by PCR) and length (gel)Sequence the DNA to determine the best pathway (defined by the DNA sequence)
![Page 26: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/26.jpg)
Cartoon Summary
![Page 27: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/27.jpg)
The DNA Algorithm• Generate Random paths through graph G (Annealing
and Ligation) • From all paths created in step 1, keep only those that
start at 0 and end at 6 (PCR with selected primers)• From all remaining paths, keep only those that visit
exactly 7 vertices (Gel purification) • From all remaining paths, keep only those that visit
each vertex at least once (Magnetic bead purification)• If any path remains, return“yes”;otherwise, return “no”
(PCR)
![Page 28: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/28.jpg)
Principles of PCR
![Page 29: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/29.jpg)
Gels & PCR
Not Exactly Routine “Calculations”
![Page 30: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/30.jpg)
Advantages of DNA Computing• With bases spaced at 0.35 nm along DNA, data
density is 400,000 Gbits/cm compared to 3 Gbits/cm in typical high performance hard drive
• 1 gram of DNA can hold about 1x1014 MB of data• A test tube of DNA can contain trillions of strands.
Each operation on a test tube of DNA is carried out on all strands in the tube in parallel
• Adleman figured his computer was running 2 x 1019 operations per joule
![Page 31: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/31.jpg)
Disadvantages of Adleman’s Computer
• NOT competitive with the state-of-the-art algorithms on electronic computers
• Time consuming laboratory procedures (2 weeks)• Good computer programs that can solve traveling
salesman problem for 100 vertices in a matter of minutes
• Adleman’s process to solve the traveling salesman problem for 200 cities would require an amount of DNA that weighed more than the Earth
![Page 32: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/32.jpg)
More Advanced DNA Computers
![Page 33: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/33.jpg)
Computing with DNA• Performs 330 trillion operations per second• A spoonful contains 15,000 trillion “computers”/automatons• Energy-efficiency is more than a million times that of a PC• Guinness World Records recognized the computer as "the
smallest biological computing device" ever constructed• DNA acts as software, enzymes act as hardware• Once the input, software, and hardware molecules are mixed
in a solution it operates to completion without intervention• The device can check whether a list of zeros and ones has an
even number of ones• It can only answer yes or no to a question
![Page 34: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/34.jpg)
Finite Automaton• Turing machine that moves in one direction• Reads a series of symbols• Changes its internal state according to transition
rules• A 2-state automaton can answer a yes-no
question by alternating between states designated as 1 and 0
• Its state at the end of the calculation represents the result
![Page 35: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/35.jpg)
Details
![Page 36: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/36.jpg)
Details
![Page 37: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/37.jpg)
Details
![Page 38: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/38.jpg)
Details
![Page 39: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/39.jpg)
Details
![Page 40: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/40.jpg)
More DNA Computing• Concept has been extended to a “DNA doctor”
computer• mRNA serves as the disease indicator (mRNA of
disease genes)• Automaton starts the computation in a “yes” state
and if all disease indicators are present it produces a “yes” state, if any mRNA components are missing it transitions to a “no” state
• Takes about 1 hour to complete calculation
![Page 41: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/41.jpg)
DNA Doctor (Computer)
![Page 42: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/42.jpg)
Are There Other Kinds of Molecular Computers?
![Page 43: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/43.jpg)
Digital Information Encoding
![Page 44: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/44.jpg)
Digital Information Encoding
![Page 45: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/45.jpg)
DNA Data Storage• HTML draft of a 53,400 word book written by the lead
researcher• 11JPG images • 1 JavaScript program • All 154 of Shakespeare's sonnets• 26 second audio clip of the "I Have a Dream" speech by
Martin Luther King• 5.5 petabits can be stored in each cubic millimeter of DNA• $12,400 to encode data and $220 for retrieval (per
Megabyte)
![Page 46: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/46.jpg)
Other Molecular Computers: The Human Brain
The world’s most advanced molecular computer
![Page 47: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/47.jpg)
The Human Brain• There are 1010 neurons in our brains• There are roughly 1015 synapses operating at
about 10 impulses/second (Biggest CPUs have 109 transistors)
• Approximately 1016 synapse operations per second (Fastest super computers [TITAN] perform at 1016 FLOPS)
• Total energy consumption of the brain is about 25 watts (Blue Gene requires 1.5 Megawatts)
http://www.merkle.com/brainLimits.html
![Page 48: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/48.jpg)
Neural Networks
![Page 49: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/49.jpg)
How We Learn
![Page 50: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/50.jpg)
How We Learn
![Page 51: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/51.jpg)
How We Learn
![Page 52: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/52.jpg)
How We Learn
![Page 53: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/53.jpg)
How We Learn
![Page 54: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/54.jpg)
How We Learn
![Page 55: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/55.jpg)
How Memories Are Formed
Emotional Reinforcement
![Page 56: Molecular Computing](https://reader036.vdocuments.site/reader036/viewer/2022062502/56814d81550346895dbae01f/html5/thumbnails/56.jpg)
Why Should I Care?• Considerable interest in molecular computing
from theoretical computer scientists (graduate research opps.)
• Source for new algorithms (fast matrix multiplication techniques, solving bounded post correspondence problem, etc.) and new concepts in computing (data storage)
• Source for bio-inspired algorithms (genetic algorithms, neural nets, agent-based computing, machine learning, etc.)