- Open Access
RNAmute: RNA secondary structure mutation analysis tool
© Churkin and Barash; licensee BioMed Central Ltd. 2006
Received: 29 January 2006
Accepted: 25 April 2006
Published: 25 April 2006
RNAMute is an interactive Java application that calculates the secondary structure of all single point mutations, given an RNA sequence, and organizes them into categories according to their similarity with respect to the wild type predicted structure. The secondary structure predictions are performed using the Vienna RNA package. Several alternatives are used for the categorization of single point mutations: Vienna's RNAdistance based on dot-bracket representation, as well as tree edit distance and second eigenvalue of the Laplacian matrix based on Shapiro's coarse grain tree graph representation.
Selecting a category in each one of the processed tables lists all single point mutations belonging to that category. Selecting a mutation displays a graphical drawing of the single point mutation and the wild type, and includes basic information such as associated energies, representations and distances. RNAMute can be used successfully with very little previous experience and without choosing any parameter value alongside the initial RNA sequence. The package runs under LINUX operating system.
RNAMute is a user friendly tool that can be used to predict single point mutations leading to conformational rearrangements in the secondary structure of RNAs. In several cases of substantial interest, notably in virology, a point mutation may lead to a loss of important functionality such as the RNA virus replication and translation initiation because of a conformational rearrangement in the secondary structure.
RNAMute is a user friendly computer tool that analyzes point mutations in the secondary structure of RNAs. Initial ideas can be found in  and associated works in the late 80's [2, 3]. Since then, much progress has been made in the field RNA secondary structure prediction , with the gradual development of sophisticated energy minimization folding prediction packages (most widely used, Zuker's mfold  and the Vienna RNA package [6, 7]). The possibility of reliably predicting conformational rearranging point mutations in the secondary structure of RNAs has been revisited in , suggesting a coarse-grain tree graph representation of the RNA secondary structure  and the use of mathematical theorems that relate to eigen-decomposition of the Laplacian matrix [9, 10] corresponding to the coarse-grain tree graphs. Both fine-grain and coarse-grain graph representations, including distance measures between the graphs, have been implemented in the Vienna RNA package . We use the Vienna RNA package as the core of RNAMute, attaching to it the mutation prediction procedure described in . To initially test the approach, experimental results from [11, 12] were taken. Motivation for the use of RNAMute can be found in the literature [13–16]. These constitute example cases in which point mutations that affect the functionality of an RNA molecule cause a conformational rearrangement in its secondary structure, as explained in detail in the final Section.
>tar xvf RNAMute.tar
More details on how to run the program are contained in the ReadMe.html file.
The package content
mute_single – performs all possible "single point mutations" in an RNA sequence. The mute_single routine predicts the secondary structure of the wild type and mutants using Vienna's RNAfold, then calculates several different representations and similarity measures between the wild type and mutants, and finally produces a "result" file from the results obtained.
RNAmute.java – the main routine. Creates a "friendly" interface for the user. Receives as input a file with an RNA sequence, runs "mute_single", and generates an HTML file called "RESULT_TABLE.html" that contains all the processed data from the "result" file organized in various tables.
calcEig2 – calculates the second smallest eigenvalue of the Laplacian matrix for each single point mutation.
b2Shapiro – converts the full structure from bracket notation to the weighted coarse grained notation introduced by Bruce Shapiro. This routine uses a function that is located in the Vienna package's "lib" directory.
runRnaMute – similar to RNAmute, but enables the user to insert the RNA sequence in a text area of the GUI instead of using a file.
RNAfold – predicts minimum energy secondary structures and base pairing probabilities.
RNAdistance – calculates the distance between two RNA secondary structures represented as dot-bracket strings.
The package also contains the source code for all its components.
While the program runs, a new directory called "htmlDir" will be created. This directory contains all the HTML pages and all the drawings of the RNA secondary structures that are being calculated.
Preparation and compilation
RNAMute is currently available on a Linux platform, therefore all preparations and compilations that will be mentioned should be performed on a Linux platform with Java and "GNU CC" compiler installed. RNAMute has all its components already compiled and may be used without any compilations, although it has some components written in C that in some architectures may not work. In such a case, the Vienna RNA package should be downloaded from the website  and directory "ViennaRNA-1.4\lib" should be compiled by running the command "make" in this directory. All files from the directory "RNAMute\RNAMute_progs" should be copied to "ViennaRNA-1.4\Progs" and compiled with "makefile". "Makefile" that appears in the "ViennaRNA-1.4\Progs" directory should be overwritten. After the compilation finishes, files: "b2Shapiro", "calcEig2", "RNAdistance", "RNAfold" and "mute_single" should be copied from the "ViennaRNA-1.4\Progs" directory to the "RNAMute\bin" directory. All files that are already in the aforementioned directory should be overwritten. The user should then make sure that all files in the "RNAMute\bin" directory are in an executable mode. If not, it is possible to change their mode by typing the command: >chmod 700 file_name, where file_name is each file from the list above.
Results and discussion
The first table in Figure 2 divides all new structures that were predicted from all point mutations to groups according to their second eigenvalue of the Laplacian matrix . This table also shows how many vertices the structure in each group contains, and the number of structures in each group. In the third column, a group that holds the wild type is marked with "WT", and groups that have the same number of vertices as the WT are marked with "*". The user can click on each value in the first column to view the list of mutations with this value and the specified number of vertices. For example, clicking on eigenvalue 0.381966 (with 5 vertices) will open the table shown in Figure 3. This table contains: (1) mutation's names. (2) distances of the mutations from the WT according to Shapiro's representation for both the mutation and the WT. Mutations in this table are sorted by this column. (3) Minimum Energy (in Kcals/mol) of the secondary structure of mutated sequence. (4) the Shapiro representation of the mutated sequence. Additional information about each mutation can be obtained by clicking on the mutation name. Figure 4 shows the HTML page with additional information for mutation C21G that contains: drawings of RNA secondary structures for the WT sequence and mutated sequence; option to download both drawings in ps format; WT sequence and the mutated sequence; the eigenvalue of the WT secondary structure and of the mutant secondary structure; the WT's free energy and the mutant free energy (in Kcals/mol); Shapiro and dot-bracket representations of both the WT and mutant; distances (according to Shapiro and dot-bracket representations) of mutant from the WT, and the average Shapiro and dot-bracket distances of all mutants.
The second table in Figure 2 divides structures to groups according to their "Dot-bracket distance" from the wild type structure. This distance is calculated between the dot-bracket representations of WT and mutations. The first column contains the distance's ranges that were calculated according to "clustering resolution" for "dot-bracket representation", which is set to 4 by default, and can be changed by the user. Clustering resolution of X means that distances are sorted in each group and if there are two distances such that the difference between them is less than X, these distances are in the same group.
The user can click on a specific distance range in the first column to observe the list of mutations with a distance in this range. For example, distance range of 38.0-38.0 has a similar table as in Figure 3 and has only 2 mutations. This distance range is interesting to explore because it contains structures of mutations with a relatively large dot-bracket distance from WT. Additional information about each mutation in each table can be obtained by pressing on the mutation name, such as in Figure 3 and the information page that will be obtained as depicted in Figure 4. In our case these are the same two mutations as were obtained from the first table (eigenvalue 0.381966) and these are the only mutations in the run that break one of two hairpins and linearize the structure.
The third table in Figure 1 is similar to the second table but it groups structures according to their Shapiro distance which is obtained from the Shapiro representation of the WT and mutation's structure. It is possible to see that the third table also groups two mutations with a relatively large distance to a separate category, and these two mutations are exactly the same mutations that were found in "Eigenvalue table" and "Dot-bracket table".
From the illustrated example we can conclude that the RNAmute package was able to find mutations that change the secondary structure of the wildtype and it divided these mutations into separate categories in all tables. In the first table these mutations fall to the category with specific second smallest eigenvalue of the Laplacian matrix corresponding to the coarse-grain tree graph representation; in the second and the third tables these mutations fall into categories with largest distances.
Availability and requirements
Project name: RNAMute
Project home page: http://www.cs.bgu.ac.il/~RNAMute
Operating system(s): web access: not applicable, stand-alone: LINUX
Programming language: C, Java
Other requirements: stand alone:Java 1.4.0 or higher, GNU CC compiler
Any restrictions to use by non-academics: None
The authors would like to thank Ornit Elgad and Oshrat Petgho for their devoted assistance at the initial stages of the RNAMute package development. The research was supported by the Lynn and William Frankel Center for Computer Sciences and a grant from the Israel USA binational foundation BSF 2003291.
- Margalit H, Shapiro BA, Oppenheim AB, Maizel JV: Detection of common motifs in RNA secondary structures. Nucleic Acids Res 1989, 17: 4829–4845.PubMed CentralView ArticlePubMedGoogle Scholar
- Shapiro BA: An algorithm for comparing multiple RNA secondary structures. Comput Appl Biosci 1988, 14: 387–393.Google Scholar
- Le SY, Nussinov R, Maizel JV: Tree graphs of RNA secondary structures and their comparisons. Comput Appl Biosci 1989, 22: 461–473.Google Scholar
- Zuker M: Calculating nucleic acid secondary structure. Curr Opin Struct Biol 2000, 10(3):303–310. 10.1016/S0959-440X(00)00088-9View ArticlePubMedGoogle Scholar
- Zuker M: Mfold web server for nucleic acid folding and hybridization prediction. Nucleic Acids Res 2003, 31: 3406–3415. 10.1093/nar/gkg595PubMed CentralView ArticlePubMedGoogle Scholar
- Hofacker IL, Fontana W, Stadler PF, Bonhoeffer LS, Tacker M, Schuster P: Fast folding and comparison of RNA secondary structures. Monatsh Chem 1994, 125: 167–188. 10.1007/BF00818163View ArticleGoogle Scholar
- Hofacker IL: Vienna RNA secondary structure server. Nucleic Acids Res 2003, 31: 3429–3431. 10.1093/nar/gkg599PubMed CentralView ArticlePubMedGoogle Scholar
- Barash D: Deleterious mutation prediction in the secondary structure of RNAs. Nucleic Acids Res 2003, 31(22):6578–6584. 10.1093/nar/gkg872PubMed CentralView ArticlePubMedGoogle Scholar
- Fiedler M: Algebraic connectivity of graphs. Czechoslovak Math J 1973, 23: 298–305.Google Scholar
- Merris R: Characteristic vertices of trees. Lin Multi Alg 1987, 22: 115–131.View ArticleGoogle Scholar
- LeCuyer KA, Crothers DM: Kinetics of an RNA molecular switch. Proc Natl Acad Sci 1994, 91: 3373–3377.PubMed CentralView ArticlePubMedGoogle Scholar
- Yusupov MM, Yusupova GZ, Baucom A, Lieberman K, Earnest TN, Cate JH, Noller HF: Crystal structure of the ribosome at 5.5 A resolution. Science 2001, 292(5518):883–96. 10.1126/science.1060089View ArticlePubMedGoogle Scholar
- Zimmerman JM, Maher LJ 3: In vivo selection of spectinomycin-binding RNAs. Nucleic Acids Res 2002, 30(24):5425–5435. 10.1093/nar/gkf687PubMed CentralView ArticlePubMedGoogle Scholar
- Smith DB, Simmonds P: Characteristics of nucleotide substitution in the Hepatitis C Virus genome: constraints on the sequence change in coding regions at both ends of the genome. J Mol Evol 1997, 45: 238–246. 10.1007/PL00006226View ArticlePubMedGoogle Scholar
- You S, Stump DD, Branch AD, Rice CM: A cis-Acting replication element in the sequence encoding the NS5B RNA-dependent RNA polymerase is required for Hepatitis C Virus RNA replication. J Virol 2004, 78: 1352–1366. 10.1128/JVI.78.3.1352-1366.2004PubMed CentralView ArticlePubMedGoogle Scholar
- Tang S, Collier AJ, Elliott RM: Alterations to both the primary and predicted secondary structure of stem-loop IIIc of the Hepatitis C Virus 1b 5' untranslated region (5' UTR) lead to mutants severely defective in translation which cannot be complemented in trans by thewild-type 5' UTR sequence. J Virol 1999, 73: 2359–2364.PubMed CentralPubMedGoogle Scholar
- Vienna RNA package[http://www.tbi.univie.ac.at/~ivo/RNA]
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.