1 / 13

DNA Computing

DNA Computing. DCS 860A-2008 Team 3 December 20, 2008 Marco Hernandez, Jeff Hutchinson, Nelson Kondulah, Kevin Lohrasbi, Frank Tsen. What is a Computer?. Until the mid 20 th century the term referred to a person. Turing Machine (1936 – 37)

sherri
Download Presentation

DNA Computing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. DNA Computing DCS 860A-2008 Team 3 December 20, 2008 Marco Hernandez, Jeff Hutchinson, Nelson Kondulah, Kevin Lohrasbi, Frank Tsen

  2. What is a Computer? • Until the mid 20th century the term referred to a person. • Turing Machine (1936 – 37) • A ‘machine’, capable of maintaining state, which operates on a ‘tape’ a series of rudimentary instructions • Universal Turing Machine (1936 - 37) • All purpose machine that can run a sequence of instructions of any arbitrary ‘Turing’ machine.

  3. Computing Machines Shapiro, E. and Y. Benenson, Computers To Life. Scientific American, 2006: p. 45-51.

  4. DNA Computing • In DNA computing, the scientist is taking advantage of the information content (the Watson-Crick pairing) of DNA’s component units. These are Nucleic Acids and they bind specifically as follows: • Adenosine Thymidine and; • Cystosine Guanidine. • Is this a programming language?

  5. Genetic Algorithms • Genetic algorithms are highly parallel mathematical algorithms that transform populations of individual mathematical objects (typically fixed-length binary character strings) into new populations using operations patterned after • Natural genetic operations such as sexual recombination (crossover) and • Fitness proportionate reproduction (Darwinian survival of the fittest) Koza, J.R. Genetically breeding populations of computer programs to solve problems in artificial intelligence. in Second International Conference on Tools for AI. 1990. Herndon, VA: IEEE Computer Society Press.

  6. DNA Computing • In 1994, Leonard Aldleman (Rivest, Shamir, Adleman) used DNA as a form of computer to solve a seven node graph problem. • From this first use, people have seen its potential in exploring the intersection of biology, chemistry, medicine, mathematics and computer science. • Research in DNA computing has primarily focused on solving mathematical problems and more recently on nanotechnology.

  7. DNA Computing • Paul W.K. Rothemund of the California Institute of Technology, is doing active research in the creation of nanoscale shapes. Paul W.K. Rothemund Home Page. 2008 [cited 2008 December 6, 2008]; Paul W. K. Rothemund Research Page]. Available from: http://www.dna.caltech.edu/~pwkr/.

  8. DNA Computing • In 2005, researchers at the Seoul National University developed a Genetic Programming method that involved DNA in silicoA decision tree implementation for the diagnosis of Acute Myelogenous and Acute Lymphoblastic leukemia (AML/ALL) was implemented in DNA. • Given a sample of a patients DNA, its disease status is determined by matching it against the decision list in the population.

  9. DNA Computing • Researchers at the Seoul National University have developed a probalistic graphical model based on undirected graphs, called the hypernetwork model, and applied it to the medical diagnosis of disease. • The authors used simulated DNA computing to create a predictive model for Cardiovascular (CV) disease.

  10. DNA Computing The table above shows the models classification results as compared to other predictive tools: SVM (Support Vector Machine); Bayesian networks, Ordinary Hypernetwork, and Evolved Hypernetwork. Each model was run nine times with 20% of the original data in each run

  11. DNA Computing • In recent years, Ehud Shapiro of the Weizmann Institute has worked on developing a DNA-based computer. His research group produced one capable of diagnosing cancer in cells and releasing drug molecules in response • In 2001, his team announced the creation of an autonomous DNA computer, i.e. once the input and ‘software’ molecules were placed in solution, computation commenced to completion with no human intervention, this managing to connect the DNA computer to its biochemical environment by sensing the state of its molecular output.

  12. DNA Computing • In 2004, Researchers from the Weizmann Institute developed autonomous biomolecular computer that, at least in vitro, logically analyses the levels of messenger RNA species, and in response produces a molecule capable of affecting levels of gene expression • The research team designed a two state molecular automaton capable of detecting a genetic prostate cancer marker. The automaton is designed to release a biologically active molecule on positive diagnosis and its suppressor molecule on negative diagnosis. • Is this a ‘nanobot’?

  13. DNA Computing • Questions ?

More Related