Simulating Bio-molecular Operations to Solve the Maximum Independent-set Problem

• Main Authors: Tung-Ten Haieh, 謝東諺
• Other Authors: Weng-Long Chang
• Format: Others
• Language: zh-TW
• Published: 2009
• Online Access: http://ndltd.ncl.edu.tw/handle/74269157857219034432

碩士 === 國立高雄應用科技大學 === 資訊工程系 === 97 === With the evolution of the technological, a general computer system has to deal with the large datasets. Therefore, increasing the performance of dealing with large-scale data was remained a difficult challenge.The best way is the parallel computing besides supercomputer. The bio-molecular operations in the new field of molecular computing were a model of parallel computing. Their principles are similar to DNA activity; each cell independently works and grows. The first exhaustive search algorithm is presented from Adleman that DNA (Deoxyribonucleic Acid) experiments are used to solve the Hamiltonian path problem (HPP). Adleman’s techniques are generalized from Lipton that using them determines the satisfiability problem (SAT). Adleman and Lipton mentioned that the DNA operation can be used to develop and design many new DNA-abased algorithms for solving the NP-complete problem. Therefore, the bio-molecular operations not only can be applied to deal with huge data, but also can be employed to solve the complexity problems, such as, the maximum independent-set problem. Because of the difficulty of nanotechnology, the bio-molecular operations only work on bio laboratory. In this thesis, we used distributed systems and concept of mutli-threads to simulate the famous bio-molecular algorithm for solving the maximum independent-set problem. The result reveals that the function of each the bio-molecular operation can be performed by the proposed method. Also we compared the performance between the proposed method and those famous algorithms. From the comparison, it is indicated that the proposed method is faster those famous algorithm.