Bioinformatics Exercises
  C.Problems. DNA Computer
  Writer : Seyeon Weon   Updated : 10-14   Hit : 2990   Updates 
(For those who have taken the courses and want to submit for evaluation, please read the instructions linked on the table of contents page.)
  1. You are designing a procedure for a DNA computer following the original method by Adleman. The aim is to find a Hamiltonian path in the following graph:

    Comparing to the graph used in the Adleman's original work, why is this graph much easier for DNA computer? What would be the most critical step that gets rid of the majority of non-solution oligomers?