Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Jurnal Ilmu Komputer dan Informasi
Mengko, Tati Rajab
Unknown Affiliation
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Detecting Type and Index Mutation in Cancer DNA Sequence Based on Needleman–Wunsch Algorithm Wisesty, Untari Novia; Mengko, Tati Rajab; Purwarianti, Ayu; Pancoro, Adi
Jurnal Ilmu Komputer dan Informasi Vol. 17 No. 2 (2024): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Informatio
Publisher : Faculty of Computer Science - Universitas Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21609/jiki.v17i2.1273

Abstract

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.
Co-Authors Adi Pancoro Ayu Purwarianti Untari Novia Wisesty