|
|
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.
|
|
|
An Interactive DNA Computing Simulator
Kovács, Martin ; Petrlík, Jiří (referee) ; Bidlo, Michal (advisor)
The aim of this work is to summarize the basic principles of operations performed over DNA molecules and to demonstrate their usage in solving some hard mathematical problems. In particular, the Hamiltonian Path Problem -- HPP (also known as the Traveling Salesman Problem) will be considered as a case study. A fundamental approach introduced by Leonard Adleman will be desctribed to solve the HPP using the DNA operations. His work may be considered as the first experiment in the area that is currently known as DNA computing. The goal of this bachelor thesis is to implement an interactive software simulator (based on the principles and formal models of Adleman's work) for solving the HPP and to evaluate its abilities with respect to area complexity considering various instances of HPP.
|
|
|
An Interactive DNA Computing Simulator
Kovács, Martin ; Petrlík, Jiří (referee) ; Bidlo, Michal (advisor)
The aim of this work is to summarize the basic principles of operations performed over DNA molecules and to demonstrate their usage in solving some hard mathematical problems. In particular, the Hamiltonian Path Problem -- HPP (also known as the Traveling Salesman Problem) will be considered as a case study. A fundamental approach introduced by Leonard Adleman will be desctribed to solve the HPP using the DNA operations. His work may be considered as the first experiment in the area that is currently known as DNA computing. The goal of this bachelor thesis is to implement an interactive software simulator (based on the principles and formal models of Adleman's work) for solving the HPP and to evaluate its abilities with respect to area complexity considering various instances of HPP.
|
guest ::
