The Optimization Spiral Dynamics Algorithm for DNA Barcoding

Abstract

Searching for compatibility between specific sequences in long DNA sequences requires accuracy and a considerable amount of time. This research was conducted to design and implement a computational model used to search a DNA barcoding in a set of DNA sequences. To obtain optimal results, we conduct the optimization spiral dynamics algorithm. Data, i.e., a collection of DNA sequences of plants, were downloaded from the NCBI website. This study produced DNA barcode by looking at the best position index which has the best percentage of matches in each sequence. The results pointed out an increase in computational time depending on the number of sequences, the number of iterations, the number of dimensions of spiral dynamics, and the number of populations.