Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2012
DOI: 10.1371/journal.pone.0052414
|View full text |Cite
|
Sign up to set email alerts
|

Crumple: A Method for Complete Enumeration of All Possible Pseudoknot-Free RNA Secondary Structures

Abstract: The diverse landscape of RNA conformational space includes many canyons and crevices that are distant from the lowest minimum free energy valley and remain unexplored by traditional RNA structure prediction methods. A complete description of the entire RNA folding landscape can facilitate identification of biologically important conformations. The Crumple algorithm rapidly enumerates all possible non-pseudoknotted structures for an RNA sequence without consideration of thermodynamics while filtering the output… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 45 publications
0
6
0
Order By: Relevance
“…We wanted to determine whether any RNA structures could be present that are encoded by degenerate sequences that could have escaped detection with Synplot2. We used the Crumple program (55) and generated all possible RNA structures in 30-nt sliding windows of sequences belonging to the naturally occurring PV1, -2, -3, and CAV20, all of which can be encapsidated into PV1, 2, 3 capsids to produce infectious viruses. We then compared the profile of conserved RNA structures to our synthetic viruses, Max and SD (Figs.…”
Section: Resultsmentioning
confidence: 99%
“…We wanted to determine whether any RNA structures could be present that are encoded by degenerate sequences that could have escaped detection with Synplot2. We used the Crumple program (55) and generated all possible RNA structures in 30-nt sliding windows of sequences belonging to the naturally occurring PV1, -2, -3, and CAV20, all of which can be encapsidated into PV1, 2, 3 capsids to produce infectious viruses. We then compared the profile of conserved RNA structures to our synthetic viruses, Max and SD (Figs.…”
Section: Resultsmentioning
confidence: 99%
“…45 Chemical probing and other experimental constraints can reduce the possible number of structures and improve the accuracy of free energy minimization predictions. 23 However, chemical probing constraints do not necessarily define a single structure, 45 and consideration of suboptimal structures or ensembles of structures provides additional insight for biological RNA structure and function. The abundance of computational tools to address the RNA folding problem highlights the problem that a single minimum free energy structure is often insufficient to describe or predict biologically relevant RNA secondary structures.…”
Section: ■ Philosophically Different Approaches Tomentioning
confidence: 99%
“…The Wuchty algorithm, the algorithm by Pipas and McMahon, and the Crumple algorithm calculate all possible non-pseduoknotted structures for a given RNA sequence. The Wuchty algorithm calculates all possible structures within a given free energy window, the size of which depends on the length of the sequence.…”
Section: Philosophically Different Approaches To Predicting Encapsida...mentioning
confidence: 99%
See 1 more Smart Citation
“…The early Pipas-McMahon RNA structure prediction algorithm sought to completely enumerate and evaluate the free energy of all possible secondary structures, thereby constructing the entire energy landscape (20). More recent algorithms have made progress in making similar enumerations less computationally intensive (21), the most successful of which are the TT2NE algorithm and its stochastic version, McGenus (22,23). The complete landscape enumeration approach including all secondary structures has so far been limited to short (<30 nt) RNA molecules (24,25), and the field has instead almost entirely been dominated by dynamic programming approaches (26)(27)(28)(29)(30).…”
Section: Introductionmentioning
confidence: 99%