History
1
an:05883231
1


Please fill in your query. A complete syntax description you will find on the General Help page.
Sparse RNA folding: time and space efficient algorithms. (English)
J. Discrete Algorithms 9, No. 1, 12-31 (2011).
Summary: The currently fastest algorithm for RNA single strand folding requires $O(nZ)$ time and $Θ(n^{2})$ space, where $n$ denotes the length of the input string and $Z$ is a sparsity parameter satisfying $n \leqslant Z
WorldCat.org
PDF XML AMS-TeX TEXT BIBTeX DOI
Valid XHTML 1.0 Transitional Valid CSS!