Use of Recurrence Plots to Find Mutations in Deoxyribonucleic Acid Sequences

Abstract

This paper examines the use of recurrence plots to find changes in the deoxyribonucleic acid (DNA) sequence. The DNA sequence is entered into the recurrence plot algorithm in codons and not consecutively, in order to make it easier to find the nucleotide change. The results show that the codon arrangement makes it easy to identify two types of mutations, insertion and deletion, by means of the recurrence plot. It is also shown that the recurrence plot of a short codon sequence has a homogeneous structure. Similarly, a comparison is made with the digital signal processing methodology. Some limitations are the number of codons that can be entered into the algorithm because computationally it becomes very slow and matrix issues, which are mentioned in the discussion section.