New hyper-heuristic algorithm for gene fragment assembly

• Main Author: Malik, Murniyanti
• Format: Thesis
• Language: English
• Published: 2017
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.utm.my/id/eprint/78793/1/MurniyantiMalikMFC2017.pdf; http://eprints.utm.my/id/eprint/78793/; http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:105781

Gene assembly is a technique to construct a gene sequence by referring to gene fragments generated by sequencing machine. The gene fragments are often short and come in large number. As the number of gene fragments increases, the complexity of the problem increases, and this situation produces a wider solution space. To solve the gene assembly problem, the gene fragments need to be arranged in the right order. However, due to the complexity and wide solution space, the accurate solution to this problem is difficult to be found. By looking from the computational perspective, gene assembly problem is considered as nondeterministic-polynomial (NP) problem, where the gene assembly problem can be solved by using metaheuristic algorithms. Metaheuristic algorithms optimize the problem by searching for almost optimal solution. In this research, a hyper-heuristic algorithm is proposed to solve gene assembly problem due to its advantages that overcome the metaheuristic algorithms. This research is conducted based on three objectives. First, to analyze two metaheuristic algorithms, Chemical Reaction Optimization (CRO) and Quantum Inspired Evolutionary Algorithm (QIEA), to solve the problem. Second, a new hyper-heuristic algorithm (QCRO) is developed based on CRO and QIEA. Third, the solutions generated from all three algorithms are evaluated by using statistical analysis. The performance of the algorithms is evaluated by convergence analysis. The similarities of the draft gene sequence generated by the algorithms are analyzed by using Basic Local Alignment Search Tool (BLAST). The findings show that QCRO is competent in finding the right order of the fragments and solving the gene assembly problem. In conclusion, this research presented a new hyper-heuristic algorithm to solve gene fragment assembly problem that is derived from two metaheuristic algorithms. This algorithm is capable of finding the right order of the gene fragments and thus solves the gene assembly problem.