2005
DOI: 10.1261/rna.7284905
|View full text |Cite
|
Sign up to set email alerts
|

HotKnots: Heuristic prediction of RNA secondary structures including pseudoknots

Abstract: We present HotKnots, a new heuristic algorithm for the prediction of RNA secondary structures including pseudoknots. Based on the simple idea of iteratively forming stable stems, our algorithm explores many alternative secondary structures, using a free energy minimization algorithm for pseudoknot free secondary structures to identify promising candidate stems. In an empirical evaluation of the algorithm with 43 sequences taken from the Pseudobase database and from the literature on pseudoknotted structures, w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
225
0

Year Published

2006
2006
2023
2023

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 249 publications
(226 citation statements)
references
References 38 publications
1
225
0
Order By: Relevance
“…HotKnots [115] adopts the strategy of pruning the initial helix space used to incrementally build the RNA structures. In this approach only sets of promising hotspots are used.…”
Section: Kinetic Foldingmentioning
confidence: 99%
“…HotKnots [115] adopts the strategy of pruning the initial helix space used to incrementally build the RNA structures. In this approach only sets of promising hotspots are used.…”
Section: Kinetic Foldingmentioning
confidence: 99%
“…Next, we analyzed the propensity of the 200, 120, 100, and 80 nt sequences surrounding the epigenetic clock CpGs to form pseudoknot and G4 structures. Hotknots [53,54] was applied to identify pseudoknot structures in the 100 nt region adjacent to clock CpGs, using Perl-based batch submissions to the Hotknots Web server. Folding predictions and their corresponding energy were also simulated using the local version of Kinefold [55].…”
Section: Methodsmentioning
confidence: 99%
“…They restricted the analysis to the class of canonical simple recursive pseudoknots, achieving O(n 4 ) time, O(n 2 ) space, and leading to a program widely used 1 today. The program HotKnots [21] uses a heuristics to assemble pseudoknots from low-energy helices.…”
Section: Folding Pseudoknotsmentioning
confidence: 99%