Maximal degenerate palindromes with gaps and mismatches (Q6073887)

The exact computation of maximal degenerate palindromes with gaps and mismatches is examined through the construction of an optimization algorithm. The algorithm identifies inverted repeats with permitted gaps and mismatches. An interesting case study is the application of the algorithm on a set of SARS-COV-2 genomes revealing unexpected significance of the patterns of its genomic signature. As a future work the authors consider the prediction of secondary structures from genomic strings through the same procedure.