TY - JOUR
T1 - DrTransformer: heuristic cotranscriptional RNA folding using the nearest neighbor energy model
AU - Badelt, Stefan
AU - Lorenz, Ronny
AU - Hofacker, Ivo L.
N1 - Accession Number: WOS:000940926100056
PubMed ID: 36655786
PY - 2023/1/1
Y1 - 2023/1/1
N2 - Motivation: Folding during transcription can have an important influence on the structure and function of RNA molecules, as regions closer to the 5
0 end can fold into metastable structures before potentially stronger interactions with the 3
0 end become available. Thermodynamic RNA folding models are not suitable to predict structures that result from cotranscriptional folding, as they can only calculate properties of the equilibrium distribution. Other software packages that simulate the kinetic process of RNA folding during transcription exist, but they are mostly applicable for short sequences. Results: We present a new algorithm that tracks changes to the RNA secondary structure ensemble during transcription. At every transcription step, new representative local minima are identified, a neighborhood relation is defined and transition rates are estimated for kinetic simulations. After every simulation, a part of the ensemble is removed and the remainder is used to search for new representative structures. The presented algorithm is deterministic (up to numeric instabilities of simulations), fast (in comparison with existing methods), and it is capable of folding RNAs much longer than 200 nucleotides.
AB - Motivation: Folding during transcription can have an important influence on the structure and function of RNA molecules, as regions closer to the 5
0 end can fold into metastable structures before potentially stronger interactions with the 3
0 end become available. Thermodynamic RNA folding models are not suitable to predict structures that result from cotranscriptional folding, as they can only calculate properties of the equilibrium distribution. Other software packages that simulate the kinetic process of RNA folding during transcription exist, but they are mostly applicable for short sequences. Results: We present a new algorithm that tracks changes to the RNA secondary structure ensemble during transcription. At every transcription step, new representative local minima are identified, a neighborhood relation is defined and transition rates are estimated for kinetic simulations. After every simulation, a part of the ensemble is removed and the remainder is used to search for new representative structures. The presented algorithm is deterministic (up to numeric instabilities of simulations), fast (in comparison with existing methods), and it is capable of folding RNAs much longer than 200 nucleotides.
UR - http://www.scopus.com/inward/record.url?scp=85147234844&partnerID=8YFLogxK
U2 - 10.1093/bioinformatics/btad034
DO - 10.1093/bioinformatics/btad034
M3 - Article
C2 - 36655786
AN - SCOPUS:85147234844
SN - 1367-4803
VL - 39
JO - Bioinformatics (Oxford, England)
JF - Bioinformatics (Oxford, England)
IS - 1
M1 - btad034
ER -