Article ID Journal Published Year Pages File Type
431338 Journal of Discrete Algorithms 2011 20 Pages PDF
Abstract

The currently fastest algorithm for RNA Single Strand Folding   requires O(nZ)O(nZ) time and Θ(n2)Θ(n2) space, where n denotes the length of the input string and Z   is a sparsity parameter satisfying n⩽Z

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Sparse RNA folding: Time and space efficient algorithms
Authors
, , , ,