Abstract
We introduce a new data structure, called MiGaL for “Multiple Graph Layers”, that is composed of various graphs linked together by relations of abstraction/refinement. The new structure is useful for representing information that can be described at different levels of abstraction, each level corresponding to a graph. We then propose an algorithm for comparing two MiGaLs. The algorithm performs a step-by-step comparison starting with the most “abstract” level. The result of the comparison at a given step is communicated to the next step using a special colouring scheme. MiGaLs represent a very natural model for comparing RNA secondary structures that may be seen at different levels of detail, going from the sequence of nucleotides, single or paired with another to participate in a helix, to the network of multiple loops that is believed to represent the most conserved part of RNAs having similar function. We therefore show how to use MiGaLs to very efficiently compare two RNAs of any size at different levels of detail simultaneously.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allali, J., Sagot, M.-F.: A new distance for high level rna secondary structure comparison. IEEE/ACM Trans. Comput. Biol. Bioinformatics 2(1), 3–14 (2005)
Cannone, J.J., Subramanian, S., Schnare, M.N., Collett, J.R., D’Souza, L.M., Du, Y., Feng, B., Lin, N., Madabusi, L.V., Muller, K.M., Pande, N., Shang, Z., Yu, N., Gutell, R.R.: The comparative RNA web (CRW) site: an online database of comparative sequence and structure infor mation for ribosomal, intron, and other RNAs. BMC Bioinformatics 3(1) (2002)
Evans, P.A.: Finding common subsequence with arcs and pseudoknots. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol. 1645, pp. 270–280. Springer, Heidelberg (1999)
Fernandez, J.A., Gonzalez, J.: Hierarchical graph search for mobile robot path planning. In: ICRA, pp. 656–661 (1998)
Fernández-Madrigal, J.-A., González, J.: Multihierarchical graph search. IEEE Trans. Pattern Anal. Mach. Intell. 24(1), 103–113 (2002)
Ferraro, P., Godin, C.: An edit distance between quotiented trees. Algorithmica 36, 1–39 (2003)
Fontana, W., Konings, D.A.M., Stadler, P.F., Schuster, P.: Statistics of RNA secondary structures. Biopolymers 33, 1389–1404 (1993)
Godin, C., Caraglio, Y.: A multiscale model of plant topological structures. Journal of theoretical biology 191, 1–46 (1998)
Höchsmann, M., Töller, T., Giegerich, R., Kurtz, S.: Local similarity in RNA secondary structures. In: Proceedings of the IEEE Computer Society Conference on Bioinformatics, p. 159. IEEE Computer Society Press, Los Alamitos (2003)
Jiang, T., Wang, L., Zhang, K.: Alignment of trees - an alternative to tree edit. In: Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, pp. 75–86. Springer, Heidelberg (1994)
Selkow, S.M.: The tree-to-tree editing problem. Inform. Process. Lett. 6(6), 184–186 (1977)
Shapiro, B.: An algorithm for multiple RNA secondary structures. Comput. Appl. Biosci. 4(3), 387–393 (1988)
Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26(3), 422–433 (1979)
Vialette, S.: Pattern matching problems over 2-interval sets. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 53–63. Springer, Heidelberg (2002)
Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245–1262 (1989)
Zuker, M., Sankoff, D.: RNA secondary structures and their prediction. Bull. Math. Biol. 46, 591–621 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Allali, J., Sagot, MF. (2005). A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison. In: Consens, M., Navarro, G. (eds) String Processing and Information Retrieval. SPIRE 2005. Lecture Notes in Computer Science, vol 3772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575832_39
Download citation
DOI: https://doi.org/10.1007/11575832_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29740-6
Online ISBN: 978-3-540-32241-2
eBook Packages: Computer ScienceComputer Science (R0)