Efficient computation of optimal oligo-RNA binding

Abstract

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 + N23), 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. © Oxford University Press 2004; all rights reserved.