Dirk Faulhammer

Learn More
We have expanded the field of ''DNA computers'' to RNA and present a general approach for the solution of satisfiability problems. As an example, we consider a variant of the ''Knight problem ,'' which asks generally what configurations of knights can one place on an n ؋ n chess board such that no knight is attacking any other knight on the board. Using(More)
We describe a convenient assay for rapid qualitative evaluation of hybridization/ligation fidelity. The approach uses randomized probe strands of DNA and restriction enzyme digestion after amplification of reaction products by the polymerase chain reaction (PCR). We report ligation efficiencies and fidelities of two DNA ligases, T4 DNA ligase and Thermus(More)
  • 1