Detecting Type and Index Mutation in Cancer DNA Sequence Based on Needleman–Wunsch Algorithm

Detecting Type and Index Mutation in Cancer DNA Sequence Based on Needleman–Wunsch Algorithm

Cancer early detection, DNA sequence, Mutation detection, Needleman-Wunsch, Sequence
alignment

Detecting DNA sequence mutations in cancer patients contributes to early identification and treatment of the disease, which ultimately enhances the effectiveness of treatment. Bioinformatics utilizes sequence alignment as a powerful tool for identifying mutations in DNA sequences. We used the Needleman-Wunsch algorithm to identify mutations in DNA sequence data from cancer patients. The cancer sequence dataset used includes breast, cervix uteri, lung, colon, liver and prostate cancer. Various types of mutations were identified, such as Single Nucleotide Variant (SNV)/substitution, insertion, and deletion, locate by the nucleotide index. The Needleman Wunch algorithm can detect type and index mutation with the average F1-scores 0.9507 for all types of mutations, 0.9919 for SNV, 0.7554 for insertion, and 0.8658 for deletion with a tolerance of 5 bp. The F1 scores obtained are not correlated with gene length. The time required ranges from 1.03 seconds for a 290 base pair gene to 3211.45 seconds for a gene with 16613 base pairs.

Untari Novia Wisesty, Tati Rajab Mengko, Ayu Purwarianti and Adi Pancoro

http://dx.doi.org/10.21609/jiki.v17i2.1273

Faculty of Computer Science Universitas Indonesia

2024-06-04

Sri Wahyuni

e-ISSN : 2502-9274 printed ISSN : 2088-7051

PDF

English

Text

Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)