Biotechnology and Computing BIF 101 – Fall 2007


Published on

  • Be the first to comment

  • Be the first to like this

Biotechnology and Computing BIF 101 – Fall 2007

  1. 1. Biotechnology and Computing BIF 101 – Fall 2007 Debra T. Burhans, Ph.D. Canisius College [email_address]
  2. 2. What is Biotechnology? <ul><li>A general definition of biotechnology is the use of biology or biological processes to develop helpful products and services. In this sense, humans have been using biotechnology (biology to create products) for centuries, for example in the breeding of farm animals for offspring with desirable traits and the use of yeast to make bread, beer, and wine. A modern definition of biotechnology is the set of biological techniques originally resulting from basic research, specifically molecular biology and genetic engineering, and now used for research and product development. Alternatively, biotechnology can be defined as the scientific manipulation of organisms at the molecular genetic level to make beneficial products. </li></ul><ul><li>http:// </li></ul>
  3. 3. Biotechnology <ul><li>Research to develop new technologies </li></ul><ul><li>Includes the application of information developed by that research to the development of commercial products </li></ul><ul><li>Includes all of the business activity that is required to bring these products to market </li></ul><ul><li>Applied in fields from agriculture to aerospace engineering </li></ul>
  4. 4. Bio-technology <ul><li>Many high-throughput techniques have been developed that enable biologists to generate tens, even hundreds of thousands of data points with a single experiment </li></ul><ul><li>Some examples include cloning, PCR, sequencing and microarrays </li></ul>
  5. 5. Molecular Biology Tools
  6. 6. Restriction Enzymes The <ul><li>Molecular “scissors” </li></ul><ul><li>Create blunt or sticky ends </li></ul><ul><li>Used singly or in combinations to cleave DNA sequences </li></ul>
  7. 7. Gel Electrophoresis
  8. 8. Blotting
  9. 9. Hybridization <ul><li>Labeled fragment of DNA (probe) is allowed to base pair with sample </li></ul><ul><li>Sample DNA may be immobilized on a membrane or may be contained in wells </li></ul><ul><li>Microarrays are small chips containing thousands of samples that are frequently used in today’s biology laboratories </li></ul>
  10. 10. Expression Data <ul><li>The context (e.g. tissue type, stage of growth of an organism, etc) of a cell determined its pattern of gene and protein expression </li></ul><ul><li>Expression patterns are measured using microarrays </li></ul><ul><li>Each spot on a microarray attracts and binds particular sequences </li></ul><ul><li>The amount of sequence bound to a spot can be quantified </li></ul><ul><li>Initially gene expression arrays, now there are protein expression arrays </li></ul><ul><li>“Genome on a chip”, can have tens of thousands of spots on one chip </li></ul>
  11. 11. Affymetrix Oligonucleotide Chip
  12. 12. Microarray Data
  13. 13. cDNA “spotted” Microarray Chip Atlantic salmon cDNA microarray
  14. 14. Microarray Data
  15. 15. Microarray Data in Spreadsheet <ul><li>Spreadsheet file </li></ul>
  16. 16. Cloning <ul><li>General strategy: use a “biological machine” to do the work </li></ul><ul><li>Isolate the piece of sequence you want to copy </li></ul><ul><li>Insert the sequence into a molecule that can replicate itself </li></ul><ul><li>Insert that molecule into (often) a bacterium that multiplies quickly </li></ul><ul><li>Each new generation of bacteria contains copies of your DNA </li></ul>
  17. 17. Making Copies - cloning
  18. 18. The Polymerase Chain Reaction The reaction is placed in an automated thermal cycler. Reactions typically have three steps: - denaturation to separate the DNA strands - approximately 95 o C - annealing to permit primers to bind to target - approximately 60 o C - actual temperature depends on composition of primers - polymerization to permit the enzyme to copy the template - approximately 72 o C This is repeated 30 or more times.
  19. 19. Making copies - PCR
  20. 20. Sequencing present and future <ul><li>Not so long ago it took a year to sequence a few hundred bases, now an entire genome can be sequenced in a day </li></ul><ul><li>The newest technologies will enable sequencing of genomes of individuals – leading the way towards “personalized medicine” </li></ul><ul><li>The ability to easily amplify a DNA sequence using PCR, creating millions of copies, has led to the use of DNA evidence in crime fighting </li></ul><ul><li>The more genomes we sequence the more we learn about how different organisms are related </li></ul><ul><li>The generation of sequence data has far outpaced our ability to analyze the data (at this point in time) </li></ul><ul><li>Data is immediately recorded in a computer and can be displayed as an electropherogram </li></ul>
  21. 21. DNA Sequencing Modern DNA sequencing is done with an automated sequencer. DNA sequencers use new technologies: - fluorescent tags for each base -permit machine basecalling - dideoxy chain termination chemistry -efficient and amenable to automation - capillary electrophoresis -permits analysis of small samples -direct output to computer -minimizes errors and speeds process
  22. 22. Sequencing: figuring out what the letters are dideoxy chain termination
  23. 23. Sequencing <ul><li>Sequences are passed through a capillary electrophoresis apparatus that arranges them by length </li></ul><ul><li>The result is that one labeled nucleotide at a time passes through the capillary tube </li></ul><ul><li>Labeled nucleotides are excited by a laser and emit a light signal corresponding to A, C, G, or T </li></ul>
  24. 24. Electropherogram
  25. 25. Sequencing Facility – Whitehead Institute
  26. 26. Pyro Sequencing <ul><li>This newest of technologies is the latest standard in sequences </li></ul><ul><li>As bases are incorporated they emit light signals, allowing a single reconstruction of an original sequence to yield all of its letters </li></ul><ul><li> </li></ul>
  27. 27. Sequencing tied to physical maps <ul><li>HGP (Human Genome Project) </li></ul><ul><li>Sequencing video </li></ul>
  28. 28. Shotgun approach DNA sequence is obtained through a “shotgun” approach: -DNA is fragmented by shooting it out of a small opening, e.g. the end of a syringe -fragments are cloned in suitable bacterial vectors -fragments are sequenced using primers flanking fragment in plasmid - sequence of fragments must be reassembled which relies on the existence of very fast, large computing resources - there are no physical maps to help with reassembly
  29. 29. Computing
  30. 30. B.C. <ul><li>Around 1600 BC the abacus, the first mechanical calculating device, was created by the Chinese (image ) </li></ul><ul><li>300-400 BC – Aristotle invented syllogistic logic, the first formal deductive reasoning system </li></ul><ul><ul><li>A, A  B ( modus ponens ) </li></ul></ul><ul><ul><li>B </li></ul></ul>
  31. 31. Early A.D. <ul><li>780-850 Algorithm – Idea invented by Mohammed ibn-Musa al-Khwarizmi, who was part of the royal court in Baghdad. </li></ul><ul><ul><li>The notion of an algorithm is fundamental to computing. An algorithm is a step by step procedure for solving a problem that is guaranteed to find the right answer after a finite number of steps. </li></ul></ul><ul><li>13 th century – Ramom Llull, a Spanish theologian, invented a machine ( Ars Magna ) for discovering nonmathematical truths through “eccentric” logic (he wanted to prove the truth of the bible) </li></ul><ul><li>1434 –self striking water clock </li></ul><ul><li>15 th century – Gutenberg and the printing press </li></ul>
  32. 32. 1500s <ul><li>1500 Leonardo DaVinci’s mechanical calculator (designed, has since been built and works). DaVinci also designed a mechanical knight </li></ul><ul><li>Early 1500s Hans Bullmann creates the first androids – simulated people that play musical instruments </li></ul><ul><li>Clock makers create mechanical animals </li></ul><ul><li>1533 Johann Muller, aka Regiomontanus, created an iron fly and an iron eagle both of which were purported to fly </li></ul><ul><li>1580 Rabbi Loew of Prague invented the Golem, a clay figure that could be brought to life </li></ul>
  33. 33. 1600s <ul><li>Descartes proposed that bodies of animal were nothing more than complex machines </li></ul><ul><li>Hobbes published The Leviathan , describing a material and combinatorial theory of thinking </li></ul><ul><li>Early 1600s Napier created Napier’s bones, carved wooden strips for mechanically computing logarithms </li></ul><ul><li>1621 Oughtred invented the slide rule based on what Napier had done </li></ul><ul><li>1642 Pascal created the first mechanical digital calculating machine </li></ul><ul><li>1673 Leibniz invented the multiplier </li></ul>
  34. 34. 1800s - I <ul><li>1801 – Jacquard invents a loom where the pattern is controlled using punched “cards” made out of wood ( </li></ul><ul><li>1811-1816 Ned Ludd leads the Luddite movement to destroy machinery (England) </li></ul><ul><li>1822 – Charles Babbage designed the Difference Engine – using Newton’s method of differences it could approximate the value of a given polynomial using only subtraction ( </li></ul>
  35. 35. 1800s - II <ul><li>Ada Byron (Lady Lovelace) worked with Babbage on his designs and is considered to be the first computer programmer </li></ul><ul><li>1833 Babbage designs the Analytical Engine, considered to be the first programmable computer – it was never built </li></ul><ul><ul><li>The analytical engine was to be powered by a steam engine and would have been over 30 meters long and 10 meters wide. The input (programs and data) was to be provided to the machine via punch cards , a method being used at the time to direct mechanical looms . For output, the machine would have a printer, a curve plotter and a bell. The machine would also be able to punch numbers onto cards to be read in later. It employed ordinary base-10 fixed-point arithmetic. There was a store (i.e., a memory) capable of holding 1,000 numbers of 50 digits each. An arithmetical unit (the &quot;mill&quot;) would be able to perform all four arithmetical operations. </li></ul></ul><ul><ul><li>The programming language to be employed was akin to modern day assembly languages . Loops and conditional branching were possible and so the language as conceived would have been Turing-complete long before Alan Turing 's concept. Three different types of punch cards were used: one for arithmetical operations, one for numerical constants, and one for load and store operations, transferring numbers from the store to the arithmetical unit or back. There were three separate readers for the three types of cards. (From Wikipedia, </li></ul></ul>
  36. 36. 1800s - III <ul><li>1847 George Boole developed a binary logic that could be used to represent (some) “laws of thought” </li></ul><ul><li>1887 Hollerith developed the modern-day punched card to tabulate the US Census, he went on to found a company that ultimately became IBM </li></ul>
  37. 37. 20 th Century <ul><li>1910-1913 Russell and Whitehead’s Principia Mathematica – leads philosophy into the logical analysis of knowledge </li></ul><ul><li>1936 Alan Turing published his paper On Computable Numbers which describes the concept of a Turing Machine </li></ul><ul><li>1943 The term “cybernetics” is coined in a paper </li></ul><ul><li>1943 – McCulloch and Pitts do pioneering work on neural networks </li></ul><ul><li>1950 – Alan Turing proposed the Turing Test to determine machine intelligence </li></ul>
  38. 38. Turing Test <ul><li>The Turing Test is considered by some to be the “gold standard” for determining whether a machine is intelligent </li></ul><ul><li>Many, however, regard it as an unsatisfactory way to define intelligence </li></ul><ul><li>Turing predicated that by the year 2000 a general machine intelligence would pass the test </li></ul><ul><li>Ray Kurzweil believes this will happen by 2020 </li></ul><ul><li>The Loebner competition is a limited version of the TT </li></ul><ul><li>Image: </li></ul>
  39. 39. First generation electronic computers 1937 - 1953 <ul><li>vacuum tubes; punched cards or magnetic tape; machine language; magnetic core memory </li></ul><ul><li>1941 Atanasoff and Berry (Iowa State) build the ABC which could solve partial differential equations with many unknowns, it was not, however, programmable </li></ul><ul><li>1943 Turing – Colossus used by British military to crack the German code in WWII </li></ul><ul><li>1945 ENIAC – first general purpose programmable computer (Eckert, Mauchly, vonNeumann) </li></ul><ul><li>1945 – first computer bug, discovered by Grace Hopper </li></ul><ul><li>1948 – transistor invented </li></ul><ul><li>1955 EDVAC – stored program concept, program and data can both be stored </li></ul><ul><li>1950s IBM mainframe computers </li></ul>
  40. 40. More Generations of Computing Machines <ul><li>Second generation electronic computers mid 50s – mid 60s </li></ul><ul><ul><li>transistors; punched cards or magnetic tape; assembly language and some high level languages; magnetic core memory </li></ul></ul><ul><li>Third generation computers: mid 60s – early 70s </li></ul><ul><ul><li>integrated circuits; silicon chips; punched cards, magnetic tape, magnetic disks; magnetic core, some semiconductor memory; e.g. IBM System/360 </li></ul></ul><ul><ul><li>1968 microprocessor invented </li></ul></ul><ul><li>Fourth generation computers: 1972 – 1984 </li></ul><ul><ul><li>VLSI (very large scale integration); microprocessor chip; magnetic disks, floppy disks; high level languages; user-friendly software; semiconductor memory </li></ul></ul><ul><ul><ul><li>1976 Apple II </li></ul></ul></ul><ul><ul><ul><li>1981 IBM PC </li></ul></ul></ul>
  41. 41. Computing Revolution <ul><li>Computers have been steadily and precipitously decreasing in price and increasing in power and storage space </li></ul><ul><li>Moore’s Law: number of transistors on chips doubles every two years </li></ul><ul><li>Update of Moore’s law: data density on chips doubles every 18 months </li></ul><ul><li>Computer science researchers continue to find new ways of solving problems </li></ul>
  42. 42. Programming <ul><li>A program is a set of instructions a computer can follow </li></ul><ul><li>There are many different programming languages </li></ul><ul><ul><li>Machine language (binary) </li></ul></ul><ul><ul><li>Assembly language (primitive instructions, e.g. ADD) </li></ul></ul><ul><ul><li>High Level language (Java, Fortran, Perl, etc.) </li></ul></ul><ul><li>Programs are what make computers behave in a certain manner </li></ul><ul><li>Algorithms can be realized as programs </li></ul>
  43. 43. Limits to computation <ul><li>P = polynomial time </li></ul><ul><li>NP = non-deterministic polynomial time </li></ul><ul><li>Problems whose solutions involve NP algorithms are effectively “not computable” </li></ul><ul><li>There are problems for which no computer can find a solution </li></ul><ul><li>This is related to a mapping between algorithms (computer programs) and the integers </li></ul><ul><li>There are more real numbers than integers, therefore there are noncomputable “numbers” (i.e. problems) </li></ul><ul><li>Until a fundamental change in the design of computers happens this will continue to be the case (possibly quantum computing) </li></ul>
  44. 44. Computer System Components (Von Neumann architecture) INPUT MEMORY PROCESSOR OUTPUT