Fig. 8
From: SparseRNAfolD: optimized sparse RNA pseudoknot-free folding with dangle consideration
We plot the results of SparseRNAFolD V2.0 against two state of the art algorithms: RNAFold and LinearFold when given RNA sequence only as input against each other and an “always dangle” model on our dataset and the dinucleotide shuffled version of our dataset and three added sequences of length: 6380, 8082, and 10241. 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)\)