|
|
Simulace a optimalizace metod DNA výpočtů
Plevač, Lukáš ; Zachariášová, Marcela (referee) ; Bidlo, Michal (advisor)
This work focuses on creating a program for simulating the SIMD||DNA computation architecture and subsequently utilizing this simulation to design new algorithms for this architecture, such as shift registers, 3-state cellular automata, or LFSR registers. SIMD||DNA belongs to the field of DNA computing architectures, which represent an unconventional computing method entirely different from today’s electronic computers. The main principle of DNA computing involves leveraging DNA properties for information processing. This method offers advantages in energy efficiency and massive parallelism, theoretically capable of surpassing current limits in information processing. It also provides higher information storage density, leading to the emergence of a new type of storage known as DNA digital data storage. SIMD||DNA is an architecture aimed at performing computations with data stored in this manner.
|
|
|
DNA Computing and Applications
Fiala, Jan ; Petrlík, Jiří (referee) ; Bidlo, Michal (advisor)
This thesis focuses on the design and implementation of an application involving the principles of DNA computing simulation for solving some selected problems. DNA computing represents an unconventional computing paradigm that is totally different from the concept of electronic computers. The main idea of DNA computing is to interpret the DNA as a medium for performing computation. Despite the fact, that DNA reactions are slower than operations performed on computers, they may provide some promising features in the future. The DNA operations are based on two important aspects: massive parallelism and principle of complementarity. There are many important problems for which there is no algorithm that would be able to solve the problem in a polynomial time using conventional computers. Therefore, the solutions of such problems are searched by exploring the entire state space. In this case the massive parallelism of the DNA operations becomes very important in order to reduce the complexity of finding a solution.
|
|
|
DNA Computing and Applications
Fiala, Jan ; Petrlík, Jiří (referee) ; Bidlo, Michal (advisor)
This thesis focuses on the design and implementation of an application involving the principles of DNA computing simulation for solving some selected problems. DNA computing represents an unconventional computing paradigm that is totally different from the concept of electronic computers. The main idea of DNA computing is to interpret the DNA as a medium for performing computation. Despite the fact, that DNA reactions are slower than operations performed on computers, they may provide some promising features in the future. The DNA operations are based on two important aspects: massive parallelism and principle of complementarity. There are many important problems for which there is no algorithm that would be able to solve the problem in a polynomial time using conventional computers. Therefore, the solutions of such problems are searched by exploring the entire state space. In this case the massive parallelism of the DNA operations becomes very important in order to reduce the complexity of finding a solution.
|
guest ::
