 Database
 Open access
 Published:
RAG: An update to the RNAAsGraphs resource
BMC Bioinformatics volumeÂ 12, ArticleÂ number:Â 219 (2011)
Abstract
Background
In 2004, we presented a web resource for stimulating the search for novel RNAs, RNAAsGraphs (RAG), which classified, catalogued, and predicted RNA secondary structure motifs using clustering and buildup approaches. With the increased availability of secondary structures in recent years, we update the RAG resource and provide various improvements for analyzing RNA structures.
Description
Our RAG update includes a new supervised clustering algorithm that can suggest RNA motifs that may be "RNAlike". We use this utility to describe RNA motifs as three classes: existing, RNAlike, and nonRNAlike. This produces 126 tree and 16,658 dual graphs as candidate RNAlike topologies using the supervised clustering algorithm with existing RNAs serving as the training data. A comparison of this clustering approach to an earlier method shows considerable improvements. Additional RAG features include greatly expanded search capabilities, an interface to better utilize the benefits of relational database, and improvements to several of the utilities such as directed/labeled graphs and a subgraph search program.
Conclusions
The RAG updates presented here augment the database's intended function  stimulating the search for novel RNA functionality  by classifying available motifs, suggesting new motifs for design, and allowing for more specific searches for specific topologies. The updated RAG web resource offers users a graphbased tool for exploring available RNA motifs and suggesting new RNAs for design.
Background
The RAG (RNAAsGraphs) web resource was launched in 2004 to classify and catalogue all possible RNA 2D topologies, including existing and hypothetical motifs http://www.biomath.nyu.edu/rna[1, 2]. RAG's construction was motivated by the increasing importance of RNAs, structurally diverse molecules with significant regulatory roles including protein synthesis, transcriptional regulation and other integral biological functions [3â€“8]. Many databases have been designed for classifying existing RNAs. These include the NDB (nucleic acid database) [9, 10], Rfam (RNA families with consensus secondary structures) [11, 12], SCOR (structural classifications of RNAs) [13, 14], RNA Strand (secondary structures) [15], and Pseudobase++ (RNAs containing pseudoknots) databases [16, 17].
To aid these classification efforts, RAG was designed to enumerate and classify all possible RNA topologies including both existing and missing motifs (Tables 1 and 2) [1, 2]. Specifically, we utilized a graphical representation of RNA secondary structure using elements of graph theory, including tree and dual graphs, adjacency matrices, and Laplacian eigenvalues. By representing secondary structures as tree and dual graphs and classifying them by their vertex number and eigenvalue spectrum, we hoped to facilitate the search for novel RNA motifs. RNA graphs were enumerated by both analytical and exhaustive computational approaches, and classified into either "existing" graphs  those found in RNA databases of solved structures or comparative structure analysis  and "missing" graphs  motifs that had not yet been found. RAG has been used for classification and prediction of noncoding RNAs [18â€“21], modification of RNA graph representations into labeled and directed graphs [18, 22â€“24], and RNA structural analysis [25â€“29]; see recent reviews [30, 31] and the Discussion section on RAG's application to RNA design.
In 2004, we expanded this work on RNA graphs to predict sequences that fold into 10 candidate topologies based on a modular approach using functional submotifs taken from existing structures [32]. That work included a clustering analysis that partitioned all nonexisting RNA topologies with 3 and 4 vertices into two classes: "RNAlike" and "nonRNAlike." A recent search of the experimentally verified noncoding RNA databases such as the Rfam database indicated that 5 of the 10 designed candidate topologies now exist in nature. Moreover, they are found in multiple RNA families (see the Discussion section on statistics of current existing topologies).
Since our 2004 work, RNA databases have grown significantly. For example, the RNA family database (Rfam), which displays consensus secondary structures for different families of RNA, had 367 families in 2004, and now contains 1,372 families (database 9.1, December 2008) [11, 12]. The RNA Strand database, which catalogues existing secondary structures from various structure databases including NDB, PDB, and others, now holds 4,666 structures that have been determined from a variety of theoretical and experimental methods such as comparative sequence analysis, NMR data, and XRay crystallography [15].
This vast increase in the amount of RNA structural data provides an opportunity to update RAG and to compare our earlier "RNAlike" and "nonRNAlike" classifications to newly discovered RNA. Further, we propose an improved classification of RNAlike and nonRNAlike topologies using a supervised clustering algorithm based on existing RNAs. In addition, we implement various improvements to our RAG web resource such as expanded search tools and a userfriendly interface.
Construction and Content
The original RAG database was designed with the following elements: graphical representations of RNA secondary topologies; Laplacian eigenvalues for quantitative description of RNA graphs; prediction of candidate RNA topologies using a clustering algorithm; and a program for converting secondary structures into RNA tree graphs. In the updated version, we improve upon the database's functionality, apply a supervised clustering algorithm to suggest candidate topologies, and compile the new RNA structures into a userfriendly interface.
RNA graphical representation
We utilize both tree and dual graphs to represent RNA structure. Tree graphs offer a general description of RNA structures, while dual graphs are more specific and allow us to represent pseudoknot structures as well (see Figure 1). The rules for expressing 2D RNA structure as tree graphs are as follows [33â€“35]:

1)
The 3' and 5' ends of a helical stem constitute a single vertex (â€¢).

2)
An RNA stem with more than one complementary base pair is considered an edge (); complementary base pairs are considered to be AU, GC, and the special case of the GU wobble.

3)
A bulge, hairpin, or internal loop is a vertex (â€¢) if there is more than one unpaired nucleotide or noncomplementary base pair.

4)
An RNA junction is considered to be a vertex (â€¢).
The rules for transforming RNA 2D topologies into dual graphs are the opposite of those for tree graphs, namely:

1)
The 3' and 5' ends do not have any representation.

2)
An RNA stem with more than one complementary base pair is represented as a vertex (â€¢).

3)
An edge () represents any single strand that has more than one unpaired nucleotide and occurs in segments connecting secondary elements of the 2D structure such as bulges, internal loops, junctions, and stems.
The main advantage of such coarsegrained representations is their reduced space compared to the atomiclevel structural space or RNA sequence space. This facilitates addressing many problems in RNA structure and allows cataloging of a finite set of graphs to represent all existing and hypothetical RNA structures.
Topological descriptors of RNA graphs: Laplacian eigenvalues
The graph connectivity is described by a Laplacian matrix constructed from the adjacency and degree matrices of each graph; the full eigenvalue spectrum of the Laplacian matrix can then be computed [1, 32]. The spectrum is useful for differentiating between RNA graphs; the number of zero eigenvalues indicates the number of disconnected elements of the graph and the value of the second smallest eigenvalue (Î»_{2}) is a measure of the complexity of the graph (a linear RNA molecule has a smaller Î»_{2} value than a branched molecule). Thus, two graphs with differing spectrum are dissimilar, though the converse is not true [32]. Since motif complexity is indicated by the second smallest eigenvalue (Î»_{2}) of the Laplacian matrix, the ordering of Î»_{2} values for topologies within each vertex number (V) is used in RAG to derive a motif identification number (ID) to distinguish the topological complexities among topologies of a certain vertex number. In RAG, all possible tree graphs up to 10 vertices and dual graphs up to 9 vertices have been enumerated and classified through this system of (V, ID, Î»_{2}).
Predicted topologies: RNAlike and nonRNAlike graphs
We employed a clustering analysis in our previous work [1, 32] to determine the potential for our enumerated topologies to be discovered in nature, i.e., to be "RNAlike". The Partitioning Around Medoids (PAM) [36] was used in conjunction with a linear transformation of the Laplacian eigenvalue spectrum of each topology to separate RNA graphs into two distinct classes as follows:

1)
The values from the Laplacian eigenvalue spectrum are transformed through a linear regression into two variables  the intercept (Î±) and the slope (Î²). Specifically, we transform the nonzero Laplacian eigenvalues for a Vvertex graph (Î»_{2}, Î»_{3},..., Î»_{V}) into two variables (Î±, Î²) by applying the leastsquares method regarding the index (2, 3,...,V). The slope Î² and the intercept Î± represent the average spacing between eigenvalues and the second eigenvalue (Î»_{2}) adjusted by Î², respectively.

2)
(Î±, Î²) is normalized to (Î±, V*Î²), because Î² decreases with the vertex number (V), and thus, V*Î² can be considered graphsize independent.

3)
A distance matrix is created from the variables (Î±, V*Î²) corresponding to the pairwise distance between all RNA graphs.

4)
Using the distance matrix in Step 3, PAM is applied to cluster all RNA graphs into two groups.
Briefly, the PAM clustering algorithm for two clusters functions by selecting in turn two representatives (also called medoids) and assigning each member into the closest group among two groups based on the distance matrix. These steps are repeated until the resulting two groups of data points have both maximum dissimilarity between groups and maximum similarity within groups. This method allowed us to classify hypothetical topologies as "RNAlike" or "nonRNAlike"; the former group of topologies is considered more likely to be found in nature.
Since PAM does not treat existing data with greater weight, we apply here an improved statistical method, the knearest neighbor (kNN) algorithm [37, 38], to classify missing motifs as RNAlike or nonRNAlike based on training data of known RNA topologies. Briefly, kNN is an instancebased supervised classification algorithm for classifying objects based on k closest training data in the description space: an object is classified by a majority vote of its neighbors, with the object being assigned to the class most common among its k nearest neighbors. Here, neighbors are defined by the Euclidian distance between graph descriptors  the transformation of Laplacian eigenvalues. Typically, the parameter k is a small number from 1 to 5. For our training sets, we use partial sets of existing and missing graphs with 34 vertices for dual graphs and 38 vertices for tree graphs. We found that k = 3 yields reasonable accuracy when the error rate is calculated by crossvalidation analysis for k = 1 to 5 (see Table 3). The assessment of kNN versus PAM is elaborated separately in the following Discussion section.
RNA Matrix: a computer program to convert RNA 2D topology to a tree graph
RAG contains the RNA Matrix program to assist structural and functional identification of RNA motifs. It converts a usersupplied secondary structure file (in 'ct' format) into its graphical representation. Essentially, our RNA Matrix program converts a tree secondary structure into an adjacency matrix through the following two steps: (1) the secondary structure file ('ct' file format) is used to define paired (P) and unpaired (U) regions of the RNA sequence. Each U region is associated with a vertex label (1, 2, 3, ...). Regions with the same label belong to the same structural elements (e.g., junctions, bulges). Identifying the U and P regions involves applying the RNA graph rules and also requires careful consideration of possible secondary structure configurations (e.g., where the chain ends occur); (2) the adjacency graph vertices are assigned by following the connecting arrows (from left to right). For dual graphs, the roles of U and P regions are reversed. RNA Matrix calculates the RNA graph's topological characteristics (vertex number, eigenvalues, order of junctions or degree of vertices, etc). Such information directs the user to the corresponding existing (or hypothetical) RNA motif in the database, with links to other RNA sequence, structure (2D and 3D) and function databases. Our RAG update introduces three significant improvements to the RNA Matrix program: first, we have now automated the classification of dual graph as well as tree graph topologies; second, we have extended the limit of 200 nt to 1000 nt and of 10 vertices to any number for tree graphs; third, we added a function to specify the direction for the graphs (5' to 3') and list common subgraphs between two RNA secondary structures. To label vertices, RNA Matrix compares the adjacency matrix of given structures to a set of standard adjacency matrices corresponding to our labeled graphs (visible on the RAG website). Subgraphs are determined by permuting all square submatrices of the structures' adjacency matrices to identify smaller graphs shared by each structure.
Utilities and Discussion
RNA database searches
We determine and classify tree and dual graphs of available secondary structures according to our topological descriptors (Tables 1 and 2). To accomplish this, we use secondary structure information from three comprehensive RNA databases to produce RNA graphs: the Rfam database, which contains the sequence alignments and consensus secondary structures of RNA families; the Pseudobase++ database, a catalogue of pseudoknot structures; and the RNA Strand database, which collects RNA secondary structures from many databases such as the RCSB Protein Databank, Nucleic Acid Database, and others. We use the following criteria for converting database structures to RNA graphs: tree graphs and dual graphs are limited to 10 vertices and 9 vertices, respectively; only RNAs of 200 nt or less are considered. Additionally, only pseudoknotcontaining structures are considered by the dual graph representation, because tree graphs cannot represent pseudoknots. The nonpseudoknot structures are represented by both tree and dual graphs.
We consider natural RNAs whose structures are solved by experimental methods, such as NMR or Xray crystallography or identified by comparative analysis to be existing RNAs. All comparative structures are currently derived from the Pseudobase++, Rfam and RNAStrand databases, while solved structures are from NDB, PDB, and Pseudobase++. The secondary structure prediction by homology modeling exploits multiple RNA sequences to infer accurate conserved secondary structures: the homologous sequences are aligned to determine conserved residues and the common secondary structure is detected by the covariation of base pairs [11]. In our earlier RAG, we also took account into structures from comparative structure analysis. Indeed, many comparatively analyzed structures have been verified by mutagenesis or chemical probing (see Table S1 in Additional file 1 for the list of Rfam IDs of families whose comparatively analyzed secondary structures are confirmed by mutagenesis or structure probing). Synthetic RNAs are not regarded as existing topologies because they were not found in nature, but designed to have a specific structure or function in vitro. Still, in the RAG resource, we show a list of synthetic RNA structures determined by experimental methods (Xray crystal structures or NMR), as listed in NDB, PDB or Pseudobase++.
We use the RNA Matrix program (available on our website for singlemolecule use) to rapidly deduce tree graph topologies from the available .ct files of RNA Strand and dual graph topologies from the .bpseq secondary structure files of Pseudobase++. We manually determine the topologies for the RNA families of Rfam, if each topology can be represented by a tree graph of 10 vertices or less or a dual graph of 4 vertices or less, because the database does not currently offer secondary structure files. The tree and dual graph topologies are then classified by motif class (existing, RNAlike, or nonRNAlike) and the method used to determine the structure.
Statistics of current existing topologies
In our 2004 work, 200 tree graph topologies were enumerated for motifs up to 10 vertices, and 53,810 dual graph topologies were enumerated for motifs up to 9 vertices (see the last columns of Tables 1 and 2). RNAs corresponding to 24 of the tree graph topologies and 29 of the dual graph topologies were found in structural databases of the time. These topologies were placed into an "existing" classification. The remaining topologies were considered "missing," and subdivided into RNAlike or "nonRNAlike" classifications by predictions made using PAM clustering. Because three of the graphs reported as existing in the 2004 RAG database could not be located currently (they were predicted by Mfold but not confirmed experimentally), the 2004 existing data as reported has been corrected: the set of 24 existing trees have now been reduced to 21 tree graphs. See Table S2 in Additional file 1 for these corrections.
Our current database searches for solved and comparativelyanalyzed structures have identified more than twice as many topologies than were found in our 2004 searches: 58 tree graphs (21 in 2004) and 71 dual graphs (29 in 2004). The first column of Tables 1 and 2 shows the current numbers of existing tree and dual topologies with vertex numbers 2 to 10 for tree graphs and 2 to 9 for dual graphs, respectively. There are 37 new tree and 42 new dual existing topologies that were previously classified as missing topologies. Figure 2 shows the breakdown of current existing tree and dual topologies for each vertex number by their status in 2004 (existing, RNAlike, or nonRNAlike). For tree graphs, 25 newlyconfirmed topologies (blue in Figure 2) were classified as RNAlike in 2004 and 12 were classified as nonRNAlike in 2004 (green in Figure 2). For dual graphs, 24 newlyconfirmed topologies were classified as RNAlike in 2004, and 18 were classified as nonRNAlike topologies in 2004. Because these results clearly leave room for improvement, we apply here a new clustering approach, supervised clustering, which depends more strongly on existing RNA (see also the previous subsection on predicted topologies).
For both tree and dual graphs, the accuracy of our predictions of RNAlike motifs depends on the method of structure discovery. Figure 3 shows the findings from newlyconfirmed topologies belonging to structures determined by different methods: experimentally solved natural RNAs, comparativelyanalyzed natural RNA sequences, and synthetically designed RNAs. Results from each method are shown by their classification in 2004: RNAlike (blue in Figure 3) and nonRNAlike (green in Figure 3). For tree graphs, when comparing RNAlike vs. nonRNAlike classifications in 2004, the numbers of topologies are 3 vs. 3 for solved structures, 23 vs. 9 for comparatively analyzed structures, and 2 vs. 1 for synthetic structures. For dual graphs, the numbers are 20 vs. 9 for solved structures, 10 vs. 10 for comparatively analyzed structures, and 14 vs. 6 for synthetic structures.
In particular, for the experimental structures, the dual graph has a much higher prediction rate (20 vs. 9, the first bar plot in Figure 3, lower) compared to tree graphs (3 vs. 3, the first bar plot in Figure 3, upper). This is because of the degeneracy of tree representations (i.e., different secondary structures can be represented as same tree topologies) and the higher sample size of solved dual graph structures (527) in contrast to solved tree structures (392) due to the addition of pseudoknot structures from Pseudobase++. However, as shown in the last two bar plot in Figure 3 (for all natural RNAs and all RNAs), though PAM clustering predictions are reasonable, there remains much room for improvement, as we discuss below. Note that there is some overlap among these topologies between different methods of discovery, and therefore the numbers are not additive for all natural RNAs (both experimental and comparative structures) and all RNAs (both natural and synthetic RNAs) as shown in the last two columns of Figure 3.
RNAs which were classified as RNAlike in 2004 and now found in RNA databases include several regulatory RNAs such as the GEMM cisregulatory element (Rfam:RF01051, tree graph ID: (6,1)), the Tobamovirus internal ribosome entry site (Rfam:RF00225, tree graph ID: (8,2)), the mammalian CPEB3 gene (Rfam:RF00622, dual graph ID: (3,2)), the Tymovirus tRNAlike 3' UTR element (Rfam:RF00233, dual graph ID: (4,1)), and the Tombusvirus 3' UTR region IV (Rfam:RF00176, dual graph ID: (4,2)). RNAs such as the SAM riboswitch (Rfam:RF00162, tree graph ID: (6,5)), the Togavirus 5' cisregulatory element (Rfam:RF00470, tree graph ID: (8,14)), and the viral 3' UTR (Pseudobase++: PKB169, dual graph ID: (4,29)) were misclassified as nonRNAlike topologies in 2004. Figures 4 and 5 show a more comprehensive selection of newlyconfirmed topologies for tree and dual graphs, respectively, with corresponding second eigenvalues, secondary structures, topological depictions, and functionalities. Figure 5a shows the five identified RNAs that correspond to our candidate topologies with 3 and 4 vertices in 2004 using PAM [32] (C1, C2, C3, C4 and C7). Often, multiple sequences correspond to a graph (for example, 6, 4 and 2 sequences correspond to dual graphs (4, 1), (4, 2) and (4, 29), respectively). Twentytwo out of 71 existing dual graphs correspond to only one sequence. We classify all these cases as existing topologies.
Assessment of kNN versus PAM clustering methods
As discussed above, PAM clustering does not employ existing data to weigh the results: PAM selects two representatives and assigns each graph into the closest group among the two groups based on the Euclidian distance matrix of graph descriptors. These steps are repeated until the resulting two groups of graphs minimize the total distance between members in each group as well as maximize the distance between the groups. The members in the group containing more existing graphs are classified as RNAlike topologies.
We now employ instead a supervised knearest neighbor (kNN) algorithm in conjunction with our RAG update. In the kNN classification, missing motifs are assigned to RNAlike or nonRNAlike topologies based on k closest training data points of existing RNAs; the distances are measured by graph descriptors. The kNN approach classifies an object according to a majority vote that depends on the object's neighbors: the object is assigned to the class most common among its k nearest neighbors. Thus, no medoids per se are defined as in PAM, and the classification changes as the data set of known RNAs increases. Our reclassification thus yields revised predictions of topologies that are more strongly guided by existing data.
To compare the performance of PAM and supervised clustering in terms of predicting RNAlike topologies, we use a standard statistical procedure, 10fold crossvalidation, in which the data are partitioned into 10 subsets, one of which is used as a training set and the others are used for prediction. Such a procedure is repeated by shuffling the data in various ways, and all predictions are averaged over these rounds. We perform 10fold crossvalidation for kNN (with k = 1 to 5) and PAM clustering based on different graph sets using the R statistical package [39].
Table 3 shows that the error rate for classification of dual graphs from 3 to 9 vertices is 615% for kNN compared to 2636% for PAM. We find that k = 3 is a good choice for the former method (see Table 3). The trend is similar for tree graphs (Table S3 in Additional file 1).
In addition, we use partial sets (2004 data set plus 50% of 2010 data) to define other training sets and again compare the performance of kNN. We have added more existing data to define these partial sets since the 2004 data set is too small on its own. Table 4 shows the results of dual graphs when the training set consists of 29 existing topologies in 2004, 21 additional existing topologies in 2010, and 50 missing graphs. Tested against all known existing motifs to date (21 new motifs), the accuracy is 95% (k = 1) to 81% (k = 5) compared to 62% for PAM. The trend is similar for tree graphs (72%83% for kNN and 77% for PAM, see Table S4 in Additional file 1).
Figure 6 compares the PAM and kNN clustering of 146 dual graphs up to 5 vertices. PAM clusters 146 topologies without prior information of existing RNAs and predicts 61 to be RNAlike (0, 5 and 56 topologies with 3, 4 and 5 vertices, respectively), while kNN reclassifies 48 topologies as RNAlike (0, 3 and 45 with 3, 4, and 5 vertices, respectively) (Table 2) based on existing RNAs with 3 and 4 vertices (25 existing topologies). Of the RNAlike topologies, 37 PAM classifications remain unchanged. Figure 6 also shows two examples of RNAlike graphs (C41 and C42, blue dots in both Figures 6b and 6d) that have similar structures to a confirmed candidate (C4, Tombusvirus 3' UTR region IV, RF00176, See Figures 5 and 9 for topologies). Eight of the 45 RNAlike topologies classified by kNN were predicted to be nonRNAlike by PAM (P1P8 in Figure 6d). Some of these eight topologies are similar to newlyconfirmed topologies. Three new candidate pseudoknots (P1P3) correspond to a substructure of Viral 3' UTR (Pseudobase++:PKB169) with an added stem. All of the newly classified RNAlike and nonRNAlike topologies are provided on our web resource http://www.biomath.nyu.edu/rna.
Reclustering of RNA topologies and comparison of 2004 and current predictions
Our analyses above suggest that the supervised clustering algorithm can better take advantage of newlyconfirmed topologies to lower the error rate and increase the accuracy in suggesting candidate RNAlike topologies. Our classification using the supervised kNN algorithm applied to all existing RNA data is shown in Tables 1 and 2. When compared to predictions in 2004, the number of RNAlike graphs increases slightly for tree graphs (from 111 to 126, the last row in Table 1) and decreases more significantly for dual graphs (from 36,571 to 16,658, the last row in Table 2).
The Updated RAG Database
The RAG update incorporates newlyconfirmed topologies and new predictions. Figure 7 depicts updated information of tree topologies up to 6 vertices, as well as a partial sampling of existing, RNAlike, and nonRNAlike topologies for 7 vertices and up. RNAs corresponding to the full tree graph library up to 6 vertices (13 topologies) have been discovered in nature. Structures representing these newly confirmed topologies have functional roles as riboswitches, cisregulatory elements, and tRNA, among many others. The full tree graph library can be viewed on our RAG website. Figure 7 also provides insights into the organization of RAG; each of the graphs within a certain vertex number is listed in order of increasing complexity, as determined by their second eigenvalues. As expected, multiple sequence and structure families map onto the same graphs. Also, there is a manytoone relationship between sequence and motif. As an example, in Figure 7, for the existing topology with 6 vertices and a second eigenvalue (Î»_{2}) of 0.3249, we originally found, in addition to a signal recognition complex, more than 20 other regulatory noncoding RNAs corresponding including OxyS (Rfam:RF00035), SraG (Rfam:RF00082), GadY (Rfam: RF00122), t44 (Rfam: RF00127), and SL2 (Rfam: 00199). Note that because some of the structures available in 2004 were not readily classified in databases of the time, our updated search reports more overall topologies from the years leading up to 2004 than were reported in the original RAG paper.
All 11 dual graph topologies for up to 3 vertices have now been discovered. The complete repertoire of newlyconfirmed topologies can be seen in Figure 8. Interestingly, several of these confirmed topologies consist of submotifs that were confirmed in 2004, linked by single stranded bridge regions. For example, the topology corresponding to the dual graph (6,78) is a combination of the (2,2) graph and the (4,15) graph via a single stranded region. This observation, along with our discovery of designed sequences from 2004, lends support to our modular design of candidate sequences. Figure 9, which contains the full dual graph library up to 4 vertices, shows some of these reclustered topologies, as indicated by blue (RNAlike) and black (nonRNAlike) coloring, along with their structural classifications (tree, bridge, or pseudoknot).
Searching for functionality and its implications for RNA design
We have applied our RNA graph classification and prediction to RNA structure analysis and design in multiple ways. For example, we have applied our graph classifications to reveal modular RNA architectures by computational analysis of existing pseudoknots and ribosomal RNAs using dual graph isomorphism [40] and discovered motifs corresponding to antibioticsbinding aptamers in genomes by searching our graphs [41]. We have also assessed topological distributions of random pools for in vitro selection based on RAG [42]. Such combinations can be applied to in vitro selection in conjunction with our RAGPOOLS web server http://rubin2.biomath.nyu.edu/ to design new RNA pools with desired topologies [43â€“45].
Other groups have extended RAG to labeled dual graphs and directed tree graphs, including graph applications to noncoding RNA classification [18â€“22]. For example, the Brenner group has added labels to our dual graphs, enabling them to construct more detailed models of RNA structures that classify noncoding RNA families [18]. The Asai group has modified our tree graphs to include direction, which has allowed them to predict noncoding RNAs [19]. Heitsch and coworkers used tree graphical representation to analyze the branching degree of entire RNA viral genomes like Hepatitis C (9,400 bases) and, in turn, proposed a new pattern of random tree degrees in graph theory [46, 47]. Knisley and coworkers extended our graph classification by developing more parameters for tree descriptors and providing a quantitative analysis of secondary structure of RNAs [48, 49].
Our RAG update includes various features such as expanded search tools, directed/labeled graph graphs, a subgraph search program, and newly suggested RNAlike topologies. We hope that these improved features will allow users to perform complex queries and apply our resource to RNA design and related problems. In particular, users can use our updated RAG in four significant ways. First, researchers can translate RNA secondary structure into tree and dual graphs without length limitations on our web server http://www.biomath.nyu.edu/rna/analysis/rna_matrix.php. For example, a set of long viral RNAs (~1000 nt) can be translated into tree and dual graphs. Second, neighboring topologies are related to existing ones by size, topology or function and can be explored, which will help to search a family of topologies. Third, new candidate RNAlike topologies can be used for searching genomes. Fourth, RNA graphs can help design new classes of structural RNAs by combining multiple graphs.
Software features
The updated version of RAG includes a program that converts a given secondary structure (in either 'ct' or 'bpseq' format) into a dual graph. Like the version of RNA Matrix for tree graphs released in 2004, users can submit a single secondary structure file for analysis. Using this file, we compute the necessary Laplacian eigenvalues and provide the corresponding dual graph topology, along with labeled vertices and directional information. The adjacency, degree, and Laplacian matrices for the structure are displayed and the common subgraphs between two structures can be evaluated. In addition, a set of secondary structures (up to 1000 ct files) can be submitted to the updated RNA Matrix program for batch processing and the resulting adjacency matrices and graph IDs can be downloaded.
We have changed our backend database from plain text files into a MYSQL relational database implementation; the relational database tables in RAG have been "normalized" to minimize the redundancy and define relationships between them. By requiring the existence of a related row in another table, we improve the database integrity and make sure that the data entered into the database are valid and consistent. The updated database using a relational database thus allows us to provide different views and more advanced queries for users (e.g., sequence searches by Rfam ID). We plan to update RAG by adding new structures reported from publications or structural databases regularly, so that new information will become accessible on each topology's subpage. We also invite users to submit their structures to us directly for inclusion in RAG.
We have also modified the frontend code to produce a better user interface; we have changed the format from static pages written in HTML and PHP serverside scripting languages into a richInternet compatible interface utilizing Web 2.0 features such as Asynchronous JavaScript and XML (AJAX) techniques.
Conclusions
An improved and updated RAG database has been designed to allow experimentalists and theoreticians to explore currently existing motifs and help suggest novel RNA motifs. The number of available structures has increased, the searching capabilities have been improved, and the web server has a more userfriendly interface and dynamic content.
Because of the translation to a combined PHP and MYSQL interface, future updates of RAG will be accessible via the web resource in real time; each tree and dual graph topology has its own subpage on the web resource that accesses the database and displays all structures corresponding to that particular topology. Thus, each addition to RAG will be displayed instantaneously on its respective online topology page.
The hypothetical 'RNAlike' topologies predicted by clustering techniques may serve as possible candidates for RNA design. Here we improved the clustering predictions made in 2004 [1, 32] by using a kNN clustering approach (Tables 1 and 2).
Availability and Requirements
The RAG database, documentation, and software can be accessed on our web server http://www.biomath.nyu.edu/rna. We invite users to experiment and report to us their experiences.
References
Fera D, Kim N, Shiffeldrim N, Zorn J, Laserson U, Gan HH, Schlick T: RAG: RNAAsGraphs web resource. BMC Bioinformatics 2004, 5: 88â€“97. 10.1186/14712105588
Gan HH, Fera D, Zorn J, Shiffeldrim N, Tang M, Laserson U, Kim N, Schlick T: RAG: RNAAsGraphs Database  Concepts, Analysis, and Features. Bioinformatics 2004, 20: 1285â€“1291. 10.1093/bioinformatics/bth084
Famulok M, Hartig JS, Mayer G: Functional aptamers and aptazymes in biotechnology, diagnostics, and therapy. Chemical Reviews 2007, 107: 3715â€“3743. 10.1021/cr0306743
Birney E, Stamatoyannopoulos JA, Dutta A, Guigo R, Gingeras TR, Margulies EH, Weng Z, Snyder M, Dermitzakis ET, et al.: Identification and analysis of functional elements in 1% of the human genome by the ENCODE pilot project. Nature 2007, 447: 799â€“816. 10.1038/nature05874
Pheasant M, Mattick JS: Raising the estimate of functional human sequences. Genome Res 2007, 17: 1245â€“1253. 10.1101/gr.6406307
Shapiro BA, Yingling YG, Kasprzak W, Bindewald E: Bridging the gap in RNA structure prediction. Curr Opin Struct Biol 2007, 17: 157â€“165. 10.1016/j.sbi.2007.03.001
Mattick JS: The functional genomics of noncoding RNA. Science 2005, 309: 1527â€“1528. 10.1126/science.1117806
Laing C, Schlick T: Computational Approaches to RNA 3D Modeling. J Phys Condens Matter 2010, 22: 283101â€“283118. 10.1088/09538984/22/28/283101
Berman HM, Olson WK, Beveridge DL, Westbrook J, Gelbin A, Demeny T, Hsieh SH, Srinivasan AR, Schneider B: The NucleicAcid Database  A Comprehensive Relational Database of 3Dimensional Structures of NucleicAcids. Biophysical J 1992, 63: 751â€“759. 10.1016/S00063495(92)816491
Berman HM, Westbrook J, Feng Z, Iype L, Schneider B, Zardecki C: The Nucleic Acid Database. Acta Crystallogr D Biol Crystallogr 2002, 58: 889â€“898. 10.1107/S0907444902003487
Gardner PP, Daub J, Tate JG, Nawrocki EP, Kolbe DL, Lindgreen S, Wilkinson AC, Finn RD, GriffithsJones S, Eddy SR, Bateman A: Rfam: updates to the RNA families database. Nucleic Acids Res 2009, 37: D136D140. 10.1093/nar/gkn766
GriffithsJones S, Bateman A, Marshall M, Khanna A, Eddy SR: Rfam: an RNA family database. Nucleic Acids Res 2003, 31: 439â€“441. 10.1093/nar/gkg006
Klosterman PS, Tamura M, Holbrook SR, Brenner SE: SCOR: A Structural Classification of RNA database. Nucleic Acids Res 2002, 30: 392â€“394. 10.1093/nar/30.1.392
Tamura M, Hendrix DK, Klosterman PS, Schimmelman NRB, Brenner SE, Holbrook SR: SCOR: Structural Classification of RNA, version 2.0. Nucleic Acids Res 2004, 32: D182D184. 10.1093/nar/gkh080
Andronescu M, Bereg V, Hoos HH, Condon A: RNA STRAND: The RNA secondary structure and statistical analysis database. BMC Bioinformatics 2008, 9: 340â€“349. 10.1186/147121059340
van Batenburg FHD, Gultyaev AP, Pleij CWA, Ng J, Oliehoek J: PseudoBase: a database with RNA pseudoknots. Nucleic Acids Res 2000, 28: 201â€“204. 10.1093/nar/28.1.201
Taufer M, Licon A, Araiza R, Mireles D, van Batenburg FHD, Gultyaev AP, Leung MY: PseudoBase plus plus: an extension of PseudoBase for easy searching, formatting and visualization of pseudoknots. Nucleic Acids Res 2009, 37: D127D135. 10.1093/nar/gkn806
Karklin Y, Meraz RF, Holbrook SR: Classification of noncoding RNA using graph representations of secondary structure. Pac Symp Biocomput 2005, 4â€“15.
Hamada M, Tsuda K, Kudo T, Kin T, Asai K: Mining frequent stem patterns from unaligned RNA sequences. Bioinformatics 2006, 22: 2480â€“2487. 10.1093/bioinformatics/btl431
MachadoLima A, del Portillo HA, Durham AM: Computational methods in noncoding RNA research. J Math Biol 2008, 56: 15â€“49.
Ng KLS, Mishra SK: De novo SVM classification of precursor microRNAs from genomic pseudo hairpins using global and intrinsic folding measures. Bioinformatics 2007, 23: 1321â€“1330. 10.1093/bioinformatics/btm026
Shu WJ, Bo XC, Zheng ZQ, Wang SQ: A novel representation of RNA secondary structure based on elementcontact graphs. BMC Bioinformatics 2008, 9: 188â€“195. 10.1186/147121059188
Haynes T, Knisley D, Knisley J: Using a neural network to identify secondary RNA structures quantified by graphical invariants. Comm Math Comput Chem 2008, 60: 277â€“290.
Haynes T, Knisley D, Seier E, Zou Y: A quantitative analysis of secondary RNA structure using domination based parameters on trees. BMC Bioinformatics 2006, 7: 108â€“118. 10.1186/147121057108
Bon M, Vernizzi G, Orland H, Zee A: Topological classification of RNA structures. J Mol Biol 2008, 379: 900â€“911. 10.1016/j.jmb.2008.04.033
Brierley I, Pennell S, Gilbert RJC: Viral RNA pseudoknots: versatile motifs in gene expression and replication. Nat Rev Microbiol 2007, 5: 598â€“610. 10.1038/nrmicro1704
Pennell S, Manktelow E, Flatt A, Kelly G, Smerdon SJ, Brierley I: The stimulatory RNA of the VisnaMaedi retrovirus ribosomal frameshifting signal is an unusual pseudoknot with an interstem element. RNA 2008, 14: 1366â€“1377. 10.1261/rna.1042108
Baird SD, Turcotte M, Korneluk RG, Holcik M: Searching for IRES. RNA 2006, 12: 1755â€“1785. 10.1261/rna.157806
Rodland EA: Pseudoknots in RNA secondary structures: Representation, enumeration, and prevalence. J Comput Biol 2006, 13: 1197â€“1213. 10.1089/cmb.2006.13.1197
Hendrix DK, Brenner SE, Holbrook SR: RNA structural motifs: building blocks of a modular biomolecule. Q Rev Biophys 2005, 38: 221â€“243. 10.1017/S0033583506004215
Leontis NB, Lescoute A, Westhof E: The building blocks and motifs of RNA architecture. Curr Opin Struct Biol 2006, 16: 279â€“287. 10.1016/j.sbi.2006.05.009
Kim N, Shiffeldrim N, Gan HH, Schlick T: Candidates for novel RNA topologies. J Mol Biol 2004, 341: 1129â€“1144. 10.1016/j.jmb.2004.06.054
Gan HH, Pasquali S, Schlick T: Exploring the repertoire of RNA secondary motifs using graph theory; implications for RNA design. Nucleic Acids Res 2003, 31: 2926â€“2943. 10.1093/nar/gkg365
Shapiro BA, Zhang KZ: Comparing multiple RNA secondary structures using tree comparisons. Comput Appl Biosci 1990, 6: 309â€“318.
Waterman MS, Smith TF: RNA Secondary Structure  Complete MathematicalAnalysis. Mathematical Biosciences 1978, 42: 257â€“266. 10.1016/00255564(78)900998
Kaufman L, Rousseeuw PJ: Finding groups in data: an introduction to cluster analysis. New York: Wiley; 1990.
Ripley BD: Pattern Recognition and Neural Networks. Cambridge: Cambridge University Press; 1996.
Venables WN, Ripley BD: Modern applied statistics with SPLUS. 3rd edition. New York: SpringerVerlag; 1999.
The R Project for Statistical Computing2004. [http://www.rproject.org/]
Pasquali S, Gan HH, Schlick T: Modular RNA architecture revealed by computational analysis of existing pseudoknots and ribosomal RNAs. Nucleic Acids Res 2005, 33: 1384â€“1398. 10.1093/nar/gki267
Laserson U, Gan HH, Schlick T: Predicting candidate genomic sequences that correspond to synthetic functional RNA motifs. Nucleic Acids Res 2005, 33: 6057â€“6069. 10.1093/nar/gki911
Gevertz J, Gan HH, Schlick T: In vitro RNA random pools are not structurally diverse: A computational analysis. RNA 2005, 11: 853â€“863. 10.1261/rna.7271405
Kim N, Gan HH, Schlick T: A computational proposal for designing structured RNA pools for in vitro selection of RNAs. RNA 2007, 13: 478â€“492. 10.1261/rna.374907
Kim N, Shin JS, Elmetwaly S, Gan HH, Schlick T: RAGPOOLS: RNAAsGraphPools  a web server for assisting the design of structured RNA pools for in vitro selection. Bioinformatics 2007, 23: 2959â€“2960. 10.1093/bioinformatics/btm439
Kim N, Izzo JA, Elmetwaly S, Gan HH, Schlick T: Computational generation and screening of RNA motifs in large nucleotide sequence pools. Nucleic Acids Res 2010, 38: e139. 10.1093/nar/gkq282
Bakhtin Y, Heitsch CE: Large deviations for random trees and the branching of RNA secondary structures. Bull Math Biol 2009, 71: 84â€“106. 10.1007/s115380089353y
Hower V, Heitsch CE: Parametric Analysis of RNA Branching Configurations. Bull Math Biol 2011.
Haynes T, Knisley D, Seier E, Zou Y: A quantitative analysis of secondary RNA structure using domination based parameters on trees. BMC Bioinformatics 2006, 7: 108â€“118. 10.1186/147121057108
Koessler DR, Knisley DJ, Knisley J, Haynes T: A predictive model for secondary RNA structure using graph theory and a neural network. BMC Bioinformatics 2010, 11(Suppl 6):S21. 10.1186/1471210511S6S21
Acknowledgements
This work is supported by the National Science Foundation (DMS0201160, CCF0727001) and the National Institute of Health (GM081410).
Author information
Authors and Affiliations
Corresponding author
Additional information
Authors' contributions
JAI and NK collected and analyzed data as well as wrote this paper. SE implemented the web interface and the relational database schema. TS designed and supervised the project including writing and editing the manuscript. All authors read and approved the final manuscript.
Joseph A Izzo, Namhee Kim contributed equally to this work.
Electronic supplementary material
12859_2010_4584_MOESM1_ESM.DOC
Additional file 1:Supplementary Tables S1S4. This additional file include the list of Rfam ID whose comparative structure is confirmed by mutagenesis or structure probing (Table S1), correction of the 2004 existing data (Table S2), crossvalidation results for tree graphs (Table S3), and tree graphs classified by partial sets (Table S4). (DOC 74 KB)
Authorsâ€™ original submitted files for images
Below are the links to the authorsâ€™ original submitted files for images.
Rights and permissions
Open Access This article is published under license to BioMed Central Ltd. This is an Open Access article is distributed under the terms of the Creative Commons Attribution License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Izzo, J.A., Kim, N., Elmetwaly, S. et al. RAG: An update to the RNAAsGraphs resource. BMC Bioinformatics 12, 219 (2011). https://doi.org/10.1186/1471210512219
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1471210512219