Ch08_GraphsDNAseq

Ch08_GraphsDNAseq - An Introduction to Bioinformatics...

Info iconThis preview shows pages 1–15. Sign up to view the full content.

View Full Document Right Arrow Icon
www.bioalgorithms.info An Introduction to Bioinformatics Algorithms Graph Algorithms in Bioinformatics
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Outline Introduction to Graph Theory Eulerian & Hamiltonian Cycle Problems Benzer Experiment and Interal Graphs DNA Sequencing The Shortest Superstring & Traveling Salesman Problems Sequencing by Hybridization Fragment Assembly and Repeats in DNA Fragment Assembly Algorithms
Background image of page 2
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info The Bridge Obsession Problem Bridges of Königsberg Find a tour crossing every bridge just once Leonhard Euler, 1735
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Eulerian Cycle Problem Find a cycle that visits every edge exactly once Linear time More complicated Königsberg
Background image of page 4
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Hamiltonian Cycle Problem Find a cycle that visits every vertex exactly once NP – complete Game invented by Sir William Hamilton in 1857
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Mapping Problems to Graphs Arthur Cayley studied chemical structures of hydrocarbons in the mid-1800s He used trees (acyclic connected graphs) to enumerate structural isomers
Background image of page 6
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Beginning of Graph Theory in Biology Benzer’s work Developed deletion mapping “Proved” linearity of the gene Demonstrated internal structure of the gene Seymour Benzer, 1950s
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Viruses Attack Bacteria Normally bacteriophage T4 kills bacteria However if T4 is mutated (e.g., an important gene is deleted) it gets disable and looses an ability to kill bacteria Suppose the bacteria is infected with two different mutants each of which is disabled – would the bacteria still survive? Amazingly, a pair of disable viruses can kill a bacteria even if each of them is disabled. How can it be explained?
Background image of page 8
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Benzer’s Experiment Idea: infect bacteria with pairs of mutant T4 bacteriophage (virus) Each T4 mutant has an unknown interval deleted from its genome If the two intervals overlap: T4 pair is missing part of its genome and is disabled – bacteria survive If the two intervals do not overlap: T4 pair has its entire genome and is enabled – bacteria die
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Complementation between pairs of mutant T4 bacteriophages
Background image of page 10
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Benzer’s Experiment and Graphs Construct an interval graph : each T4 mutant is a vertex, place an edge between mutant pairs where bacteria survived (i.e., the deleted intervals in the pair of mutants overlap) Interval graph structure reveals whether DNA is linear or branched DNA
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Interval Graph: Linear Genes
Background image of page 12
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Interval Graph: Branched Genes
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Interval Graph: Comparison Linear genome Branched genome
Background image of page 14
Image of page 15
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/10/2012 for the course CSE 5615 taught by Professor Mitra during the Fall '11 term at FIT.

Page1 / 91

Ch08_GraphsDNAseq - An Introduction to Bioinformatics...

This preview shows document pages 1 - 15. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online