SLIDE 1
2
THE TRAVELLING SALESMAN PROBLEM
solutions.
MAPMEN THE TRAVELLING SALESMAN PROBLEM solutions. 2 THE TRAVELLING - - PowerPoint PPT Presentation
MAPMEN THE TRAVELLING SALESMAN PROBLEM solutions. 2 THE TRAVELLING - - PowerPoint PPT Presentation
MAPMEN THE TRAVELLING SALESMAN PROBLEM solutions. 2 THE TRAVELLING SALESMAN PROBLEM y is the TSP impor 3 THE TRAVELLING SALESMAN PROBLEM y is the TSP impor 3 THE TRAVELLING SALESMAN PROBLEM y is the TSP impor 3 THE TRAVELLING SALESMAN
SLIDE 2
SLIDE 3
y is the TSP impor
3
THE TRAVELLING SALESMAN PROBLEM
SLIDE 4
y is the TSP impor
3
THE TRAVELLING SALESMAN PROBLEM
SLIDE 5
y is the TSP impor
3
THE TRAVELLING SALESMAN PROBLEM
SLIDE 6
y is the TSP impor
3
THE TRAVELLING SALESMAN PROBLEM
SLIDE 7
y is the TSP impor
3
THE TRAVELLING SALESMAN PROBLEM
SLIDE 8
y is the TSP impor
3
THE TRAVELLING SALESMAN PROBLEM
SLIDE 9
Number of Cities Number of Routes Brute Force Time* 4 3
1/3 millisecond
5 12 1 millisecond 10 181 440 18 seconds 13 239 500 800 7 hours 15 43 589 145 600 50 days 16 653 837 184 000 2 years 20 60 822 550 000 000 000 193 millennia *Assuming 10 000 routes mapped per second.
4
THE TRAVELLING SALESMAN PROBLEM
SLIDE 10
4
HAMILTONIAN GRAPH PROBLEM
SLIDE 11
COMPUTATION IN BIOLOGICAL TERMS
solutions.
SLIDE 12
ApR RFP aCP KanR ClrR GFP
5
COMPUTATION IN BIOLOGICAL TERMS
A R B K purple/AmpR/KanR A B C G Green/AmpR/ClrR R K C G Orange/KanR/ClrR
SLIDE 13
Ori GFP ClrR ApR aCP Ori ApR aCP KanR RFP Ori ClrR KanR GFP RFP
5
COMPUTATION IN BIOLOGICAL TERMS
ApR RFP aCP KanR ClrR GFP
SLIDE 14
6
COMBINATORIAL PLASMID ASSEMBLY
SLIDE 15
Step 4 6 8
Ori ClrR RFP GFP KanR
dA18 dT18
10
A 10-piece sequential assembly
A unique solution It’s plasmid analogue
C K G R
RFP GFP ClrR KanR Ori
Kan/Chlr
7
COMBINATORIAL PLASMID ASSEMBLY
SLIDE 16
transformation
Kan/Chlr 652 complete solutions (orange colonies) 69 incomplete solutions (red +green colonies)
8
COMBINATORIAL PLASMID ASSEMBLY
SLIDE 17
8
PLASMID IDENTIFICATION BY PHENOTYPE
SLIDE 18
ApR RFP aCP KanR ClrR GFP
10
PROOF OF PRINCIPLE
1 ¡ 1 ¡ 1 ¡ 1 ¡
SLIDE 19
11
PROOF OF PRINCIPLE
SLIDE 20
12
PROOF OF PRINCIPLE
SLIDE 21
12
PROOF OF PRINCIPLE
SLIDE 22
13
PROOF OF PRINCIPLE
SLIDE 23
The 15-city problem
14
PHASE II: FIFTEEN CITY PROBLEM
120 inter-city paths 43 589 145 600 unique routes
SLIDE 24
15
K R T S A H C W Y F D E N Q P
Assembly step: N
cities are represented by essential genes selected from 15 amino acid biosynthetic pathways
Cities are represented by essential genes selected from 15 amino acid biosynthetic pathways. A strain of E. coli that carries deletions for the 15 city genes.
PHASE II: FIFTEEN CITY PROBLEM
SLIDE 25
16
REVISED CITY-PATH STRATEGY
SLIDE 26
17
CONSTRUCTING A COSMID LIBRARY
SLIDE 27
18
PCR ANALYSIS
SLIDE 28
- A complete library of solutions can be
created through simultaneous in vitro manipulation of 109 to 1012 DNA molecules.
- Solutions can be hierarchically biased and
amplified toward the best using…
- Sequential gene assembly
- Accurate distance-to-concentration conversion
- Phage packaging
- Essential genes for all cities
18
THE BIOCOMPUTATIONAL ADVANTAGE
Eliminating the cost of complexity
SLIDE 29
23