Sequence Alignment Using Nature-Inspired Metaheuristic Algorithms

Abstract

Abstract-The most basic process in sequence analysis is sequence alignment, usually solved by dynamic programming Needleman-Wunsch algorithm. However, Needleman-Wunsch algorithm has some lack when the length of the sequence which is aligned is big enough. Because of that, sequence alignment is solved by metaheuristic algorithms. In the present, there are a lot of new metaheuristic algorithms based on natural behavior of some species, we usually call them as nature-inspired metaheuristic algorithms. Some of those algorithm that are more efficient are firefly algorithm, cuckoo search, and flower pollination algorithm. In this research, we use those algorithms to solve sequence alignment. The results show that those algorithms can be used to solve sequence alignment with good result and linear time computation.Index Terms-Nature-inspired metaheuristic algorithms, sequence alignment.

Estimasi Parameter Super Pairwise Alignment pada Kombinasi Virus Dengue Menggunakan Particle Swarm Optimization

“…Pada penelitian sebelumnya, di Indonesia terdapat empat jenis virus dengue atau demam berdarah [1]. Untuk melihat tingkat kesamaan (similarity) antara dua sekuens virus, dibutuhkan proses pensejajaran pada sekuens virus [2]. Metode yang digunakan untuk pensejajaran pada dua sekuens virus adalah Super Pairwise Alignment (SPA).…”

Application Bat Algorithm for Estimating Super Pairwise Alignment Parameters on Similarity Analysis Between Virus Protein Sequences

“…SPA-parameters selection is often applied by trial and error [4]. Because the similarity score is affected on SPA-parameters, the problems of this research are how we can estimate and optimize SPA-parameters maximizing similarity score between dengue virus and zika virus, so that the purpose of this research is applying meta-heuristic method, such as Bat Algorithm (BA) algorithm to estimate and optimize SPAparameters which can maximize similarity score.…”