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 .
Chapter 8: Graph AlgorithmsJuly/23/2012Name: Xuanyu HuProfessor: Elise de Doncker
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 vertices in this graph, visit every other vertex exactly once, and end up at the original vertex?
Game invented by Sir
William Hamilton in 1857
Seymour Benzer, 1950s
Sanger method (1977): labeled ddNTPs terminate DNA copying at random points.
Start at primer (restriction site)
Grow DNA chain
Stops reaction at all possible points
Separate products by length, using gel electrophoresis
s1, s2,…., sn as substrings, such that the length of s is minimized
graphs, vertex(vertices), edges, connected, disconnected, cycles, trees, degree, leaf