Maximal degenerate palindromes with gaps and mismatches (Q6073887)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7748737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximal degenerate palindromes with gaps and mismatches |
scientific article; zbMATH DE number 7748737 |
Statements
Maximal degenerate palindromes with gaps and mismatches (English)
0 references
12 October 2023
0 references
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.
0 references
degenerate palindrome
0 references
string factorisation
0 references
inverted repeat
0 references
mismatch
0 references
0 references
0 references
0.7746633887290955
0 references
0.7667224407196045
0 references
0.7309972047805786
0 references
0.7258789539337158
0 references
0.7141599059104919
0 references
