The folding landscape for an RNA sequence contains many diverse structures and motifs, which are often sampled rather than completely explored. Today's supercomputers make the complete enumeration of all possible folds for an RNA and a detailed description of the RNA folding landscape a more feasible task. This chapter provides protocols for using the Crumple folding algorithm, an efficient tool to generate all possible non-pseudoknotted folds for an RNA sequence. Crumple in conjunction with Sliding Windows and Assembly can incorporate experimental constraints on the global features of an RNA, such as the minimum number and lengths of helices, which may be determined by crystallography or cryo-electron microscopy. This complete enumeration method is independent of free-energy minimization and allows the user to incorporate experimental data such as chemical probing, SELEX data on RNA-protein binding motifs, and phylogenetic covariation.
Keywords: Complete enumeration of RNA secondary structures; Global RNA helical constraints; Parallel computing; RNA ensembles; RNA structure prediction; Viral RNA.