Lee este artículo en voz alta
Enciende el micrófono y lee a tu ritmo. Las palabras se iluminan sobre la marcha y nadie te detiene por un error.
Tu audio nunca llega a MovaReader: lo reconoce tu navegador. Política de Privacidad
Inicia sesión para guardar esta sesión en tu historial de lectura.
Synthetic Biology and DNA Computing
Mara wanted a straight answer to a strange report. In 1994, Leonard Adleman had solved a small routing puzzle with DNA in a tube. He wrote, in the paper itself, that the graph was small enough to solve by looking. The interesting question was not whether DNA had beaten a computer. It was whether the molecules had really carried out the steps.
He set a directed graph of seven vertices, with a chosen start and a chosen end, and asked for a path that visits each vertex once. He encoded each vertex, and each one-way link that really existed, as a short strand of DNA. Where a link was legal, those strands could bind, and an enzyme could join them into longer molecules. Huge numbers of strands met in the same tube, so many candidate paths formed together.