Unformatted text preview: ns—that is, run a program. DNA is a great way to store information. In fact, the cell has been using this method to store the “blueprint for life” for billions of years. Further, enzymes such as polymerases and ligases have been used to operate on this information. Was there enough to build a universal computer? Because of the lessons of the 1930s, I was sure that the answer was yes. The Hamiltonian Path Problem T he next task was choosing a problem to solve. It should not appear to be contrived to ﬁt the machine, and it should demonstrate the potential of this novel method of computation. The problem I chose was the Hamiltonian Path Problem. William Rowan Hamilton was Astronomer Royal of Ireland in the mid19th century. The problem that has come to bear his name is illustrated in the box on the opposite page. Let the arrows (directed edges) represent the nonstop ﬂights between the cities (vertices) in the map (graph). For example, you can ﬂy nonstop from Boston to Chicago but not from Chicago to Boston. Your job (the Hamiltonian Path Problem) is to determine if a sequence of connecting ﬂig...
View Full Document
- Fall '08
- DNA, Hamiltonian path, DNA computer