Professional Documents
Culture Documents
n
TRAVELLING SALESMAN
ALGORITHM
A hypothetical salesman tries to find a route through a set of cities so that he visits
each city only once
Chicago
Source Destination
Los Angeles New York
Dallas Miami
Adleman’s Experiment
Specifically, the method based on
Adleman’s experiment would be as
follows:
City Encoding
Route Encoding
Miami
CTACGGATGCCG
CTA CGG
Miami New York Miami to New York
GC CTAC
CGGATG
New York
G C C TA G
ATG CCG
Hybridized DNA
Output of Stage I
CTAGTA
Chicago
GCTACG ATGCCG
Los Angeles New York
Source Destination
Dallas Miami
TCGTAC CTACGG
PART II : Select itineraries that start and
end with the correct cities
STRATEGY : Selectively copy & amplify only selection of DNA that
start with Los Angeles & ends with New York .
START END
PRIMER PRIMER
CGATGC TACGGC
GCTACG ATGCCG
Los Angeles New York
Source Destination