Key points are not available for this paper at this time.
DNA sequences are differing with respect to their size in billions of nucleotides range. Pattern matching is significant for information processing in computer field in identifying the functional and structural behaviour of genes. In this proposed study, the pattern matching of sequences have been performed for the large set of DNA sequences. The pattern matching is effectively performed by using the Fast Reliable Cartesian Tree Algorithm (FRCT), where patterns are encoded and shifting patterns are enhanced which reduces the computational time and assures high reliability. The proposed algorithm shows better pattern matching in terms of execution time compared with various existing strategies performed on suitable large DNA sequences dataset.
.C et al. (2024) studied this question.