The RNAFoldProgs package
RNA secondary structure following Fast Folding and Comparison of RNA Secondary Structures, Hofacker et al., 1994. Uses the Turner 2004 parameter set. The algorithm work on an algebraic ring structure that is instanciated as required. This prelimenary release contains the minimum-free energy version only.
Do not expect good runtimes with anything less than 6.13.201008xx. The newest head produces an executable roughly 20x faster than GHC 6.12.3.
Bugs are likely present in this algorithm. If you find one, please send me a mail.
One goal is to get the vector library to optimise the loops (fold's) in such a way as to get performance close to the ViennaRNA package. Right now, we are about 15x slower.
Works well with -Odph, -fllvm (llvm is about 70% faster than -fasm)
0.0.0.3 forgot a lot of depends!
|Versions||0.0.0.1, 0.0.0.2, 0.0.0.3|
|Dependencies||base (==4.*), Biobase (==0.0.2.*), BiobaseTurner (>=0.0.2.1 && <0.0.3), BiobaseTypes (>=0.0.2.1 && <0.0.3), BiobaseVienna (==0.0.2.*), cmdargs (==0.6), containers, HsTools (>=0.0.1.1), primitive (==0.3.*), PrimitiveArray (==0.0.2.*), RNAFold (==0.0.2.*), split (>=0.0.2.1), vector (==0.7.*) [details]|
|Copyright||Christian Hoener zu Siederdissen (Haskell), Ivo L. Hofacker et al. (ViennaRNA package)|
|Author||Christian Hoener zu Siederdissen (Haskell), Ivo L. Hofacker et al. (ViennaRNA package)|
|Uploaded||Thu Sep 23 11:53:04 UTC 2010 by ChristianHoener|
|Downloads||872 total (7 in the last 30 days)|
|Status||Docs not available [build log]
All reported builds failed as of 2016-10-25 [all 10 reports]
Hackage Matrix CI
For package maintainers and hackage trustees