Chapter 8: Graph Algorithms July/23/2012 Name: Xuanyu Hu Professor: Elise de Doncker. Outline. Graphs Graphs and Genetics DNA Sequencing Shortest Superstring Problem. 1: Graphs. Diagrams with collections of points connected by lines are examples of graphs .
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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Find a tour crossing every bridge just once
Leonhard Euler, 1735
Bridges of Königsberg
More complicated Königsberg
Can you travel from any one of the the correct sequence of moves.vertices in this graph, visit every other vertex exactly once, and end up at the original vertex?Hamiltonian Cycle Problem
Game invented by Sir
William Hamilton in 1857
Seymour Benzer, 1950s the correct sequence of moves.2: Graphs and Genetics
Sanger method (1977): labeled ddNTPs terminate DNA copying at random points.
Start at primer (restriction site) the correct sequence of moves.
Grow DNA chain
Stops reaction at all possible points
Separate products by length, using gel electrophoresisSanger Method: Generating Read
s1, s2,…., sn as substrings, such that the length of s is minimized
graphs, vertex(vertices), edges, connected, disconnected, cycles, trees, degree, leaf