Abstract
—Corona virus is a virus capable of mutating very quickly and many other viruses that arise due to mutations of this virus. To find out the location of corona virus mutations of one type to another, DNA sequences can be aligned using the Needleman-Wunsch algorithm. Corona virus data was taken from Genbank National Center for Biotechnology Information from 1985-1992. The Needleman-Wunsch algorithm is a global alignment algorithm in which alignment is performed to all sequences with the complexity of O (mn) and is capable of producing optimal alignment. An important step in this reserach is the sequence alignment of two corona viruses using the Needleman-Wunsch algorithm. Second, identification of the location of mutations from the DNA of the virus. The result of this reserach is an alignment and the location of mutations of both sequences. The results of identification DNA mutation can be used to find out other viruses mutation corona virus as well as can be used in the field of health as a reference for the manufacture of drugs for corona virus mutation outcome.
Highlights
Computational biology is the field of science that focuses on the preparation of a mathematical model in solving and analyzing biological sequence problems
The corona virus DNA sequence data will be used with the following details: DNA sequence data1: Avian infectious bronchitis virus peplomeric protein gene encoding the S1 and S2 subunits, complete cds with length is 1605 bp year 1989
Based on the analysis of the results of program testing, it can be concluded that the Needleman-Wunsch algorithm can be applied to identify mutations in the DNA sequence of the corona virus
Summary
Computational biology is the field of science that focuses on the preparation of a mathematical model in solving and analyzing biological sequence problems. To find out whether this corona virus is a relative or not, a method is needed that can align the corona virus DNA with one another These problems can be solved using dynamic programming. This algorithm was originally created by Saul Needleman and Christian Wunsch in 1970 [4] This algorithm is a dynamic programming implementation that is used to determine the level of similarity or the compatibility of two texts. By looking at the results and the process of the Needleman-Wunsch algorithm in DNA alignment, this study discusses how the Needleman-Wunsch algorithm can be used to align the DNA sequences of the corona virus so that they can determine the presence of mutations in the corona virus. The program implementation is done using the Python programming language with Anaconda software and Jupyter Notebook 5.0.0 application
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
