- #1
ryokan
- 252
- 5
Ten years ago (Science 1994;266:1021-4), Adelman built the first DNA based computer to solve the so-called Hamilton Path problem for seven nodes. SAT problems were solved with similar approaches by Lipton (Science 1995;268:542-5), with a DNA-based algorithm and Faulhammer (PNAS 2000;97.1385-9) who used a RNA-based algorithm .
The initial excitement following these reports was constrained by major limitations: mainly, the need of a massive amount of DNA and the exponential increase in the chance of error to solve larger-scale problems.
I pose the following questions:
Do you think that molecular computation is promising?
Since its first use, DNA computation had a seemingly slow development. Why? I think that besides the intrinsic limitations, this field, by interdisciplinary, is less attractive than other "hot" topics in Biology.
The initial excitement following these reports was constrained by major limitations: mainly, the need of a massive amount of DNA and the exponential increase in the chance of error to solve larger-scale problems.
I pose the following questions:
Do you think that molecular computation is promising?
Since its first use, DNA computation had a seemingly slow development. Why? I think that besides the intrinsic limitations, this field, by interdisciplinary, is less attractive than other "hot" topics in Biology.