Abstract
RNAs are molecules that are essential to any living organism. The minimum free-energy (MFE) structure represents the most stable structure among all of the structures adopted by a sequence. The suboptimal backtrack can be adapted to any algorithm based on an unambiguous dynamic programming scheme. It remains valid for an ambiguous decomposition, albeit generating some structures redundantly. Comparative folding represents a final category of methods for structure prediction. Since the logarithm is a monotonously increasing function, optimizing the logarithm of the objective function is equivalent to optimizing the objective function. The principle behind the Sankoff algorithm is at the core of virtually every approach for comparative prediction. The partition function is essential to adopt a statistical perspective over the Boltzmann ensemble. The partition function is an essential quantity to derive the statistical properties of the folding space.
Original language | English |
---|---|
Title of host publication | From Sequences to Graphs |
Subtitle of host publication | Discrete Methods and Structures for Bioinformatics |
Publisher | wiley |
Pages | 185-231 |
Number of pages | 47 |
ISBN (Electronic) | 9781394169634 |
ISBN (Print) | 9781394169641 |
DOIs | |
State | Published - 9 Sep 2022 |
Externally published | Yes |
Keywords
- Ambiguous decomposition
- Comparative folding
- Dynamic programming scheme
- MFE structure
- Partition function
- RNA folding
- Sankoff algorithm
- Statistical properties
- Suboptimal backtrack
ASJC Scopus subject areas
- General Computer Science