Seconds on average to nd the unique hamiltonian path

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Gel electrophoresis is then used to isolate those molecules that have the right sequence length of 24. August 1998 Computing with DNA 58 Scientific American Copyright 1998 Scientific American, Inc. seconds on average to find the unique Hamiltonian path in this graph. (You may begin now....) To simplify the discussion here, consider the map on page 56, which contains just four cities—Atlanta, Boston, Chicago and Detroit—linked by six flights. The problem is to determine the existence of a Hamiltonian path starting in Atlanta and ending in Detroit. I began by assigning a random DNA sequence to each city. In our example, Atlanta becomes ACTTGCAG, Boston TCGGACTG and so on. It was convenient to think of the first half of the DNA sequence as the first name of the city and the second half as the last name. So Atlanta’s last name is GCAG, whereas Boston’s first name is TCGG. Next, I gave each nonstop flight a DNA “flight number,” obtained by concatenating the last name of the city of origin wi...
View Full Document

This note was uploaded on 11/28/2011 for the course COMP 790 taught by Professor Staff during the Fall '08 term at UNC.

Ask a homework question - tutors are online