Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: DNA strand

Sortuj według:

Ogranicz wyniki do:

Long DNA strands synthesis optimizing

Nowak R., Romaniuk M.

Prace Naukowe Politechniki Warszawskiej. Elektronika

2008

z. 165

157-163

The method described in this paper helps to syntheses DNA (deoxyribonucleic acid) molecules with length about 1000 bp, using typical techniques enable to create strands of length up to 70 bp. The given DNA strand is divided into smaller fragments, and next these fragments are connected by proposed protocol in genetic laboratory. The evolutionary algorithm is used to find the optimal solution. The freely accessible application called longdna, based on presented ideas was implemented and tested on simulated and real data.

A molecular inference via colorimetric change

Mulawka J.

Prace Naukowe Politechniki Warszawskiej. Elektronika

2008

z. 165

139-146

In this work the inference performed on DNA molecules is considered. The process known as self-assembling of DNA strands is fundamental to achieve longer chains of molecules encoding knowledge base. By proper organization of this process any logic operations can be accomplished. In particular, systems based on decision trees may be easy assembled. A severe problem of nano-systems is to provide communication between nano-world and real-world. To solve this problem it is proposed to make use of colorimetric change phenomenon. Here an inference procedure is proposed that allows to check the knowledge base in form of decision tree. Although DNA strands react in the nano-world, due to optical read-out the inference result is attained quickly and easy. Thus, complicated and expensive operations of genetic engineering laboratory are eliminated.

A theoretical model of the Shapiro finite state automaton built on DNA

Krasiński T., Sakowski S.

Theoretical and Applied Informatics

2006

Vol. 18, nr 3

161-174

In the paper a theoretical model (in the form of a splicing system) of a DNA computing machine, constructed in Weizmann Institute of Science by Benenson, Adar, Paz-Elizur, Livneh and Shapiro [4] is given. This splicing system exactly reflects the action of the DNA computer. We describe in detail finite state automaton built on DNA and give its scheme of computation.

W obecnie prowadzonych pracach nad nanosystemami informatyki bada się możliwość wykorzystania DNA do kodowania i przetwarzania informacji. W artykule opracowany jest teoretyczny model (w postaci systemu splatania „splicing system") DNA komputera skonstruowanego w Instytucie Weizmanna przez zespół: Benenson, Adar, Paz-Elizur, Livneh i Shapiro. Model ten dokładnie odzwierciedla działanie tego DNA komputera. Omówiono działanie automatu skończonego opartego na DNA oraz podano jego schemat ideowy działania.