RNA molecules fold into complex structures that are crucial to their biological function. Secondary structure is an RNA abstraction with biological relevance and computational tractability. Structural motifs within these configurations are essential for understanding and classifying RNA functionality and are often implicated in disease mechanisms. Existing pattern-matching approaches can identify sequence motifs, structural motifs, and sequence–structure motifs. However, they often lack the expressiveness needed to capture complex patterns, particularly pseudoknots. This paper introduces Linear RNA Diagram Logic (LiRNA), a novel logic inspired by classical temporal logics. We show that LiRNA is expressive enough to specify sequence, structural, and sequence–structure patterns over RNA secondary structures, including pseudoknots. We present a model-checking algorithm for LiRNA that reduces sequence–structure pattern matching to the satisfaction of logical formulas. The algorithm is proven correct, and its worst-case complexity is shown to be proportional to the product of the formula size and the input structure length raised to the power of one plus the number of existential quantifiers in the formula.

A Formal Approach to Identify Structural Patterns in RNA

Loreti, Michele;Quadrini, Michela;Tesei, Luca
2025-01-01

Abstract

RNA molecules fold into complex structures that are crucial to their biological function. Secondary structure is an RNA abstraction with biological relevance and computational tractability. Structural motifs within these configurations are essential for understanding and classifying RNA functionality and are often implicated in disease mechanisms. Existing pattern-matching approaches can identify sequence motifs, structural motifs, and sequence–structure motifs. However, they often lack the expressiveness needed to capture complex patterns, particularly pseudoknots. This paper introduces Linear RNA Diagram Logic (LiRNA), a novel logic inspired by classical temporal logics. We show that LiRNA is expressive enough to specify sequence, structural, and sequence–structure patterns over RNA secondary structures, including pseudoknots. We present a model-checking algorithm for LiRNA that reduces sequence–structure pattern matching to the satisfaction of logical formulas. The algorithm is proven correct, and its worst-case complexity is shown to be proportional to the product of the formula size and the input structure length raised to the power of one plus the number of existential quantifiers in the formula.
2025
9783032014351
9783032014368
Modal logic
Model checking
RNA pattern matching
RNA secondary structure
Temporal logic
268
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11581/496124
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact