•  
  •  
 

ORCID

Mahmoud Y. Shams: 0000-0003-3021-5902

Romany M. Farag: 0009-0003-1564-3156

Dalia A. Aldawody: 0009-0001-2315-8316

Huda E. Khalid: 0000-0002-6599-120X

Ahmed K. Essa: 0000-0001-6153-9964

Hazem M. El-Bakry: 0000-0002-4798-0427

A. A. Salama: 0000-0003-2300-615X

Article Type

Original Study

Abstract

Identifying similar DNA sequences is crucial in various biological research endeavors. This paper delves into the intricate workings of a specific algorithm designed for this purpose. We provide a systematic explanation, exploring how the algorithm handles user input, reads stored DNA sequences, utilizes the Word2Vec model for vector representation, and calculates sequence similarity using diverse metrics like Cosine Similarity and Neutrosophic Distance. Additionally, the paper explores the incorporation of neutrosophic values to account for uncertainty in the comparisons. Finally, we discuss the extraction of results, including matched sequences, similarity scores, and accuracy measures. This in-depth exploration provides a clear understanding of the algorithm's capabilities and fosters its effective application in DNA sequence analysis.

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Share

COinS