Efficient computation of optimal oligo–RNA binding

AUTOR(ES)

Hodas, Nathan O.

FONTE

Oxford University Press

RESUMO

We present an algorithm that calculates the optimal binding conformation and free energy of two RNA molecules, one or both oligomeric. This algorithm has applications to modeling DNA microarrays, RNA splice-site recognitions and other antisense problems. Although other recent algorithms perform the same calculation in time proportional to the sum of the lengths cubed, O((N1 + N2)3), our oligomer binding algorithm, called bindigo, scales as the product of the sequence lengths, O(N1·N2). The algorithm performs well in practice with the aid of a heuristic for large asymmetric loops. To demonstrate its speed and utility, we use bindigo to investigate the binding proclivities of U1 snRNA to mRNA donor splice sites.

Documentos Relacionados

• Separation of oligo-RNA by reverse-phase HPLC.
• Inhibition of human immunodeficiency virus (HIV-1) replication by synthetic oligo-RNA derivatives.
• A Review of Gradient Algorithms for Numerical Computation of Optimal Trajectories
• The Sm domain is an ancient RNA-binding motif with oligo(U) specificity
• A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure