Assembly_final

# Assembly_final - An Introduction to Bioinformatics...

This preview shows pages 1–11. Sign up to view the full content.

www.bioalgorithms.info An Introduction to Bioinformatics Algorithms Graph Algorithms in Bioinformatics and Genome Assembly

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

View Full Document
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Outline Introduction to Graph Theory 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
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

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

View Full Document
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 Bridge Walking Problem Solution: 1 2 3 4 5 6 3 7 2 9 11 8 7 12 11 10 9 1 Note, all vertices have even degree.
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

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

View Full Document
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. A tree with n vertices must have n-edges. Caley used this property to find structural isomers.
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

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

View Full Document
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?
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

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

View Full Document
An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Interval Graph G=(V,E) a b c e d c a b d e V= set of vertices represent intervals E= set of edges There is an edge between two vertices v and w in V if and only if the intervals v and w overlap.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 06/12/2011 for the course CAP 5510 taught by Professor Staff during the Spring '08 term at University of Central Florida.

### Page1 / 70

Assembly_final - An Introduction to Bioinformatics...

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

View Full Document
Ask a homework question - tutors are online