Local Exact Pattern Matching for Non-fixed RNA Structures
Detecting local common sequence-structure regions of RNAs is a biologically meaningful problem. By detecting such regions, biologists are able to identify functional similarity between the inspected molecules. We developed dynamic programming algorithms for finding common structure-sequence patterns between two RNAs. The RNAs are given by their sequence and a set of potential base pairs with associated probabilities. In contrast to prior work which matches fixed structures, we support the arc breaking edit operation; this allows to match only a subset of the given base pairs. We present an O(n 3) algorithm for local exact pattern matching between two nested RNAs, and an O(n 3logn) algorithm for one nested RNA and one bounded-unlimited RNA.
KeywordsBase Pair Time Complexity Maximal Match Edit Operation Tree Edit Distance
Unable to display preview. Download preview PDF.
- 7.Evans, P.A.: Algorithms and Complexity for Annotated Sequence Analysis. PhD thesis, University of Alberta (1999)Google Scholar
- 10.Jiang, T., Wang, L., Zhang, K.: Alignment of trees – an alternative to tree edit. TCS: Theoretical Computer Science 143 (1995)Google Scholar
- 11.Klein, P.N.: Computing the Edit-Distance between Unrooted Ordered Trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 91–102. Springer, Heidelberg (1998)Google Scholar