Skip to main content
Fig. 7 | Algorithms for Molecular Biology

Fig. 7

From: SparseRNAfolD: optimized sparse RNA pseudoknot-free folding with dangle consideration

Fig. 7

We plot the results of the three versions of SparseRNAFolD when given an RNA sequence, an “exclusive dangle” model, and a random pseudoknot-free structure as input against each other based on our dataset. a Memory usage (maximum resident set size in KB) versus length (log-log plot) over all benchmark instances. The solid line shows an asymptotic fit \((c_1+c_2n^x)\) for sequence length n, constants \(c_1\),\(c_2\), and exponent x for the fit. We ignored all values \(< 1000\). b Run-time (s) versus length (log-log plot) over all benchmark instances. For each tool in both plots, we report (in parenthesis) the exponent x that we estimated from the benchmark results; it describes the observed complexity as \(\Theta (n^x)\)

Back to article page