Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
- 1 February 2000
- journal article
- research article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 7 (1-2) , 171-182
- https://doi.org/10.1089/10665270050081441
Abstract
We present an implementation of McCaskill’s algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The program can be used to routinely fold RNA sequences of more than 10,000 nucleotides. Applications to complete viral genomes are discussed.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Base Pairing Probabilities in a Complete HIV-1 RNAJournal of Computational Biology, 1996
- Optimization and Performance Analysis of a Massively Parallel Dynamic Programming Algorithm for Rna Secondary Structure PredictionThe International Journal of Supercomputer Applications and High Performance Computing, 1995
- A Molecular RheostatJournal of Molecular Biology, 1994
- Comparative studies of RNA: inferring higher-order structure from patterns of sequence variationCurrent Opinion in Structural Biology, 1993
- RNA pseudoknotsCurrent Opinion in Structural Biology, 1992
- Coexistence of multiple codes in messenger RNA moleculesComputers & Chemistry, 1992
- The equilibrium partition function and base pair binding probabilities for RNA secondary structureBiopolymers, 1990
- On Finding All Suboptimal Foldings of an RNA MoleculeScience, 1989
- The HIV-1 rev trans-activator acts through a structured target sequence to activate nuclear export of unspliced viral mRNANature, 1989
- RNA secondary structure: a complete mathematical analysisMathematical Biosciences, 1978