Abstract
Local similarity is an important tool in comparative analysis of biological sequences, and is therefore well studied. In particular, the Smith-Waterman technique and its normalized version are two established metrics for measuring local similarity in strings. In RNA sequences however, where one must consider not only sequential but also structural features of the inspected molecules, the concept of local similarity becomes more complicated. First, even in global similarity, computing global sequence-structure alignments is more difficult than computing standard sequence alignments due to the bi-dimensionality of information. Second, one can view locality in two different ways, in the sequential or structural sense, leading to different problem formulations.
In this paper we introduce two sequentially-local similarity metrics for comparing RNA sequences. These metrics combine the global RNA alignment metric of Shasha and Zhang [16] with the Smith-Waterman metric [17] and its normalized version [2] used in strings. We generalize the familiar alignment graph used in string comparison to apply also for RNA sequences, and then utilize this generalization to devise two algorithms for computing local similarity according to our two suggested metrics. Our algorithms run in \(\mathcal{O}(m^2 n \lg n)\) and \(\mathcal{O}(m^2 n \lg n+n^2m)\) time respectively, where m ≤n are the lengths of the two given RNAs. Both algorithms can work with any arbitrary scoring scheme.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alliali, J., Sagot, M.-F.: A new distance for high level RNA secondary structure comparison. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2(1), 4–14 (2005)
Arslan, A.N., Eǧecioğlu, Ö., Pevzner, P.A.: A new approach to sequence alignment: normalized sequence alignment. Bioinformatics 17(4), 327–337 (2001)
Backofen, R., Will, S.: Local sequence-structure motifs in RNA. Journal of Bioinformatics and Computational Biology (JBCB) 2(4), 681–698 (2004)
Chartrand, P., Meng, X.-H., Singer, R.H., Long, R.M.: Structural elements required for the localization of ASH1 mRNA and of a green fluorescent protein reporter particle in vivo. Current Biology 9, 333–336 (1999)
Chen, S., Wang, Z., Zhang, K.: Pattern matching and local alignment for RNA structures. In: International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS), pp. 55–61 (2002)
Couzin, J.: Breakthrough of the year. Small RNAs make big splash. Science 298(5602), 2296–2297 (2002)
Currey, K.M., Sasha, D., Shapiro, B.A., Wang, J., Zhang, K.: An algorithm for finding the largest approxemately common substructure of two trees. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(8), 889–895 (1998)
Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An O(n 3)-time algorithm for tree edit distance. Technical Report arXiv:cs.DS/0604037, Cornell University (2006)
Efraty, N., Landau, G.M.: Sparse normalized local alignment. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 333–346. Springer, Heidelberg (2004)
Giegerich, R., Höchsmann, M., Kurtz, S., Töller, T.: Local similarity in RNA secondary structures. In: Computational Systems Bioinformatics (CSB), pp. 159–168 (2003)
Guignon, V., Chauve, C., Hamel, S.: An edit distance between RNA stem-loops. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 335–347. Springer, Heidelberg (2005)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Press Syndicate of the University of Cambridge (1997)
Jiang, T., Lin, G., Ma, B., Zhang, K.: A general edit distance between RNA structures. Journal of Computational Biology 9(2), 371–388 (2002)
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)
Moore, P.B.: Structural motifs in RNA. Annual review of biochemistry 68, 287–300 (1999)
Shasha, D., Zhang, K.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing 18(6), 1245–1262 (1989)
Smith, T.F., Waterman, M.S.: The identification of common molecular subsequences. Journal of Molecular Biology 147, 195–197 (1981)
Wang, J., Zhang, K.: Identiffying consensus of trees through alignment. Information Sciences 126, 165–189 (2000)
Zuker, M.: On finding all suboptimal foldings of an RNA molecule. Science 244(4900), 48–52 (1989)
Zuker, M., Stiegler, P.: Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Research 9(1), 133–148 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Backofen, R., Hermelin, D., Landau, G.M., Weimann, O. (2006). Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. In: Lewenstein, M., Valiente, G. (eds) Combinatorial Pattern Matching. CPM 2006. Lecture Notes in Computer Science, vol 4009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780441_23
Download citation
DOI: https://doi.org/10.1007/11780441_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35455-0
Online ISBN: 978-3-540-35461-1
eBook Packages: Computer ScienceComputer Science (R0)