graphs and dna sequencing
DESCRIPTION
Graphs and DNA sequencing. CS 466 Saurabh Sinha. Three problems in graph theory. Eulerian Cycle Problem. Find a cycle that visits every edge exactly once Linear time. Find a cycle that visits every vertex exactly once NP – complete . Hamiltonian Cycle Problem. Game invented by Sir - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/1.jpg)
Graphs and DNA sequencing
CS 466Saurabh Sinha
![Page 2: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/2.jpg)
Three problems in graph theory
![Page 3: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/3.jpg)
Eulerian Cycle Problem
• Find a cycle that visits every edge exactly once
• Linear time
![Page 4: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/4.jpg)
Hamiltonian Cycle Problem
• Find a cycle that visits every vertex exactly once
• NP – complete
Game invented by Sir William Hamilton in 1857
![Page 5: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/5.jpg)
Travelling Salesman Problem• Find the cheapest tour of a given
set of cities
• “Cost” associated with going from any city to any other city
• Must visit every city exactly once
• NP-complete
![Page 6: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/6.jpg)
DNA Sequencing
![Page 7: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/7.jpg)
DNA Sequencing
• Shear DNA into millions of small fragments
• Read 500 – 700 nucleotides at a time from the small fragments (Sanger method)
![Page 8: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/8.jpg)
Fragment Assembly
• Computational Challenge: assemble individual short fragments (reads) into a single genomic sequence (“superstring”)
![Page 9: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/9.jpg)
Strategies for whole-genome sequencing
1. Hierarchical – Clone-by-clone yeast, worm, humani. Break genome into many long fragmentsii. Map each long fragment onto the genomeiii. Sequence each fragment with shotgun
2. Whole Genome Shotgun fly, human, mouse, rat, fugu
One large shotgun pass on the whole genomeUntil late 1990s the shotgun fragment assembly of human genome
was viewed as intractable problem
![Page 10: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/10.jpg)
Shortest Superstring Problem
• Problem: Given a set of strings, find a shortest string that contains all of them
• Input: Strings s1, s2,…., sn
• Output: A string s that contains all strings s1, s2,…., sn as substrings, such that the length of s is minimized
• Complexity: NP – complete
![Page 11: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/11.jpg)
Shortest Superstring Problem: Example
![Page 12: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/12.jpg)
Shortest Superstring Problem
• Can be framed as Travelling Salesman Problem (TSP):
• Overlap(si,sj) = largest overlap between si and sj
• Complete directed graph with vertices for substrings (si) and edge weights being -overlap(si,sj)
![Page 13: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/13.jpg)
Shortest Superstring Problem
• Doesn’t help to cast this as TSP– TSP is NP-complete
• Early sequencing algorithms used a greedy approach: merge a pair of strings with maximum overlap first– Conjectured to have performance
guarantee of 2.
![Page 14: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/14.jpg)
Generating the fragments
+ =
Shake
DNA fragments
VectorCircular genome(bacterium, plasmid)
Knownlocation(restrictionsite)
Cloning (many many copies)
![Page 15: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/15.jpg)
Different Types of VectorsVECTOR Size of insert
(bp)
Plasmid 2,000 - 10,000
Cosmid 40,000
BAC (Bacterial Artificial Chromosome) 70,000 - 300,000
YAC (Yeast Artificial Chromosome)
> 300,000Not used much
recently
![Page 16: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/16.jpg)
Read Coverage
Length of genomic segment: LNumber of reads: n Coverage C = n l / LLength of each read: l
How much coverage is enough?
Lander-Waterman model:Assuming uniform distribution of reads, C=10 results in 1 gapped region per 1,000,000 nucleotides
C
![Page 17: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/17.jpg)
Lander-Waterman Model
• Major Assumptions– Reads are randomly distributed in the genome– The number of times a base is sequenced follows
a Poisson distribution
• Implications– G= genome length, L=read length, N = # reads– Mean of Poisson: =LN/G (coverage)– % bases not sequenced: p(X=0) =0.0009 = 0.09%– Total gap length: p(X=0)*G
( )!
xep X xx
−
= = Average times
This model was used to plan the Human Genome Project…
![Page 18: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/18.jpg)
Challenges in Fragment Assembly• Repeats: A major problem for fragment assembly• > 50% of human genome are repeats:
- over 1 million Alu repeats (about 300 bp)- about 200,000 LINE repeats (1000 bp and
longer)Repeat Repeat Repeat
Green and blue fragments are interchangeable when assembling repetitive DNA
![Page 19: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/19.jpg)
Repeat-related problems in assembly
AB C
Overlap information (by comparing reads):A,B;B,C;A,C
Shortest superstring: combine A & C !
![Page 20: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/20.jpg)
Dealing with repeats
• Approach 1: Break genome into large fragments (e.g., 150,000 bp long each), and sequence each separately.
• The number of repeats comes down proportionately (e.g., 30,000 times for human genome)
![Page 21: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/21.jpg)
Dealing with repeats• Approach 2: Use “mate-pair” reads• Fragments of length ~ L are selected, and both ends
are sequenced– L >> length of typical repeat
• Reads are now in pairs, separated by approximately known distance (L)
• Both reads of a mate-pair are unlikely to lie in repeat regions
• Using their approximate separation, we can resolve assembly problems
![Page 22: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/22.jpg)
Shotgun Sequencing
cut many times at random (Shotgun)
genomic segment
Get one or two reads from
each segment~500 bp ~500 bp
![Page 23: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/23.jpg)
A completely different sequencing method:Sequencing by Hybridization
• 1988: SBH suggested as an an alternative sequencing method. Nobody believed it will ever work
• 1991: Light directed polymer synthesis developed by Steve Fodor and colleagues.
• 1994: Affymetrix develops first 64-kb DNA microarray
First microarray prototype (1989)
First commercialDNA microarrayprototype w/16,000features (1994)
500,000 featuresper chip (2002)
![Page 24: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/24.jpg)
How SBH Works
• Attach all possible DNA probes of length l to a flat surface, each probe at a distinct and known location. This set of probes is called the DNA array.
• Apply a solution containing fluorescently labeled DNA fragment to the array.
• The DNA fragment hybridizes with those probes that are complementary to substrings of length l of the fragment.
![Page 25: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/25.jpg)
How SBH Works (cont’d)
• Using a spectroscopic detector, determine which probes hybridize to the DNA fragment to obtain the l–mer composition of the target DNA fragment.
• Apply a combinatorial algorithm to reconstruct the sequence of the target DNA fragment from the l – mer composition.
![Page 26: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/26.jpg)
l-mer composition• Spectrum ( s, l ) - unordered multiset of
all possible (n – l + 1) l-mers in a string s of length n
• The order of individual elements in Spectrum ( s, l ) does not matter
![Page 27: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/27.jpg)
The SBH Problem• Goal: Reconstruct a string from its l-mer
composition
• Input: A set S, representing all l-mers from an (unknown) string s
• Output: String s such that Spectrum(s,l ) = S
Different from the Shortest Superstring Problem
![Page 28: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/28.jpg)
SBH: Hamiltonian Path Approach
S = { ATG AGG TGC TCC GTC GGT GCA CAG }
Path visited every VERTEX once
ATG AGG TGC TCCH GTC GGT GCA CAG
ATGCAGG TCC
![Page 29: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/29.jpg)
SBH: Eulerian Path Approach S = { ATG, TGC, GTG, GGC, GCA, GCG, CGT }
Vertices correspond to ( l – 1 ) – mers : { AT, TG, GC, GG, GT, CA, CG }
Edges correspond to l – mers from S
AT
GT CG
CAGCTG
GG Path visited every EDGE once
![Page 30: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/30.jpg)
Euler Theorem
• A graph is balanced if for every vertex the number of incoming edges equals to the number of outgoing edges:
in(v)=out(v)• Theorem: A connected graph is Eulerian
(has an Eulerian cycle) if and only if each of its vertices is balanced.
![Page 31: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/31.jpg)
Euler Theorem: Proof
• Eulerian → balanced
for every edge entering v (incoming edge) there exists an edge leaving v (outgoing edge). Therefore
in(v)=out(v)• Balanced → Eulerian
???
![Page 32: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/32.jpg)
Algorithm for Constructing an Eulerian Cycle
a. Start with an arbitrary vertex v and form an arbitrary cycle with unused edges until a dead end is reached. Since the graph is Eulerian this dead end is necessarily the starting point, i.e., vertex v.
![Page 33: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/33.jpg)
Algorithm for Constructing an Eulerian Cycle (cont’d)
b. If cycle from (a) is not an Eulerian cycle, it must contain a vertex w, which has untraversed edges. Perform step (a) again, using vertex w as the starting point. Once again, we will end up in the starting vertex w.
![Page 34: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/34.jpg)
Algorithm for Constructing an Eulerian Cycle (cont’d)
c. Combine the cycles from (a) and (b) into a single cycle and iterate step (b).
![Page 35: Graphs and DNA sequencing](https://reader036.vdocument.in/reader036/viewer/2022062316/568167b8550346895ddd063d/html5/thumbnails/35.jpg)
SBH as Eulerian Path Problem
• A vertex v is “semibalanced” if | in-degree(v) - out-degree(v)| = 1
• If a graph has an Eulerian path starting from s and ending at t, then all its vertices are balanced with the possible exception of s and t
• Add an edge between two semibalanced vertices: now all vertices should be balanced (assuming there was an Eulerian path to begin with). Find the Eulerian cycle, and remove the edge you had added. You now have the Eulerian path you wanted.