ViennaRNA

The ViennaRNA Package consists of a C code library and several stand-alone programs for the prediction and comparison of RNA secondary structures. RNA secondary structure prediction through energy minimization is the most used function in the package. We provide three kinds of dynamic programming algorithms for structure prediction: the minimum free energy algorithm of (Zuker & Stiegler 1981) which yields a single optimal structure, the partition function algorithm of (McCaskill 1990) which calculates base pair probabilities in the thermodynamic ensemble, and the suboptimal folding algorithm of (Wuchty et.al 1999) which generates all suboptimal structures within a given energy range of the optimal energy. For secondary structure comparison, the package contains several measures of distance (dissimilarities) using either string alignment or tree-editing (Shapiro & Zhang 1990). Finally, we provide an algorithm to design sequences with a predefined structure (inverse folding).


References in zbMATH (referenced in 22 articles , 1 standard article )

Showing results 1 to 20 of 22.
Sorted by year (citations)

1 2 next

  1. Clote, P.: Are RNA networks scale-free? (2020)
  2. Greenwood, Torin; Heitsch, Christine E.: On the problem of reconstructing a mixture of \textscrnastructures (2020)
  3. Roy, Suvam; Bapat, Niraja V.; Derr, Julien; Rajamani, Sudha; Sengupta, Supratim: Emergence of ribozyme and tRNA-like structures from mineral-rich muddy pools on prebiotic Earth (2020)
  4. Willmott, Devin; Murrugarra, David; Ye, Qiang: Improving RNA secondary structure prediction via state inference with deep recurrent neural networks (2020)
  5. Clote, Peter; Bayegan, Amir H.: RNA folding kinetics using Monte Carlo and Gillespie algorithms (2018)
  6. Li, Thomas J. X.; Reidys, Christian M.: The rainbow spectrum of RNA secondary structures (2018)
  7. Walter Costa, Maria Beatriz; Höner zu Siederdissen, Christian; Tulpan, Dan; Stadler, Peter F.; Nowick, Katja: Temporal ordering of substitutions in RNA evolution: uncovering the structural evolution of the Human Accelerated Region 1 (2018)
  8. Bayegan, Amir H.; Clote, Peter: An IP algorithm for RNA folding trajectories (2017)
  9. Berkemer, Sarah J.; Höner zu Siederdissen, Christian; Stadler, Peter F.: Algebraic dynamic programming on trees (2017)
  10. Keith, Jonathan M. (ed.): Bioinformatics. Volume II: structure, function, and applications (2017)
  11. Ota, Makoto; Seki, Shinnosuke: Rule set design problems for oritatami systems (2017)
  12. Fellermann, Harold; Lopiccolo, Annunziata; Kozyra, Jerzy; Krasnogor, Natalio: In vitro implementation of a stack data structure based on DNA strand displacement (2016)
  13. Jin, Emma Yu; Nebel, Markus E.: RNA secondary structures in a polymer-zeta model how foldings should be shaped for sparsification to establish a linear speedup (2016)
  14. Riechert, Maik; Höner zu Siederdissen, Christian; Stadler, Peter F.: Algebraic dynamic programming for multiple context-free grammars (2016)
  15. Picardi, Ernesto (ed.): RNA bioinformatics (2015)
  16. Clote, Peter; Ponty, Yann; Steyaert, Jean-Marc: Expected distance between terminal nucleotides of RNA secondary structures (2012)
  17. Elloumi, Mourad (ed.); Zomaya, Albert Y. (ed.): Algorithms in computational molecular biology. Techniques approaches and applications. (2011)
  18. Kijima, Atsushi; Kobayashi, Satoshi: Efficient algorithm for testing structure freeness of finite set of biomolecular sequences (2006)
  19. Rodriguez, German; Badia, Rosa M.; Labarta, Jesús: Generation of simple analytical models for message passing applications (2004)
  20. Gabriel, Edgar; Keller, Rainer; Lindner, Peggy; Müller, Matthias S.; Resch, Michael M.: Software development in the grid: The DAMIEN tool-set (2003)

1 2 next