Content deleted Content added
made plural Tags: Visual edit Mobile edit Mobile web edit |
No edit summary Tags: Visual edit Mobile edit Mobile web edit |
||
Line 18:
== Applications, examples, and recent developments ==
In 1994 [[Leonard Adleman]] presented the first prototype of a DNA computer. The [[:de:TT-100|TT-100]] was a test tube filled with 100 microliters of a DNA solution. He managed to solve an instance of the directed [[Hamiltonian path]] problem.<ref>Braich, Ravinderjit S., et al. "Solution of a satisfiability problem on a gel-based DNA computer." ''DNA Computing''. Springer Berlin Heidelberg, 2001. 27-42.</ref> In Adleman's experiment, the Hamiltonian Path Problem was implemented notationally as the "[[travelling salesman problem]]". For this purpose, different DNA fragments were created, each one of them representing a city that had to be visited. Every one of these fragments is capable of a linkage with the other fragments created. These DNA fragments were produced and mixed in a [[test tube]]. Within seconds, the small fragments form bigger ones, representing the different travel routes. Through a chemical reaction, the DNA fragments representing the longer routes were eliminated. The remains are the solution to the problem, but overall, the experiment lasted a week.<ref>{{cite journal | last1 = Adleman | first1 = Leonard M | year = 1998 | title = Computing with DNA | journal = Scientific American | volume = 279 | issue = 2| pages = 54–61 | doi = 10.1038/scientificamerican0898-54 | bibcode = 1998SciAm.279b..54A }}</ref> However, current technical limitations prevent the evaluation of the results. Therefore, the experiment isn't suitable for the application, but it is nevertheless a [[proof of concept]].
=== Combinatorial problems ===
| |||