 Proceedings
 Open Access
 Published:
Shape and secondary structure prediction for ncRNAs including pseudoknots based on linear SVM
BMC Bioinformatics volume 14, Article number: S1 (2013)
Abstract
Background
Accurate secondary structure prediction provides important information to undefirstafinding the tertiary structures and thus the functions of ncRNAs. However, the accuracy of the native structure derivation of ncRNAs is still not satisfactory, especially on sequences containing pseudoknots. It is recently shown that using the abstract shapes, which retain adjacency and nesting of structural features but disregard the length details of helix and loop regions, can improve the performance of structure prediction. In this work, we use SVMbased feature selection to derive the consensus abstract shape of homologous ncRNAs and apply the predicted shape to structure prediction including pseudoknots.
Results
Our approach was applied to predict shapes and secondary structures on hundreds of ncRNA data sets with and without psuedoknots. The experimental results show that we can achieve 18% higher accuracy in shape prediction than the stateoftheart consensus shape prediction tools. Using predicted shapes in structure prediction allows us to achieve approximate 29% higher sensitivity and 10% higher positive predictive value than other pseudoknot prediction tools.
Conclusions
Extensive analysis of RNA properties based on SVM allows us to identify important properties of sequences and structures related to their shapes. The combination of mass data analysis and SVMbased feature selection makes our approach a promising method for shape and structure prediction. The implemented tools, Knot Shape and Knot Structure are open source software and can be downloaded at: http://www.cse.msu.edu/~achawana/KnotShape.
Background
Noncoding RNAs (ncRNAs), which are transcribed but not translated into proteins, play diverse and important biological functions in all living organisms [1]. Many types of ncRNAs perform their functions through both their sequences and secondary structures, which are defined by the interacting base pairs. Of the characterized secondary structures of ncRNAs, WatsonCrick (CG and AU) and wobble base p airs (GU) are most commonly seen. As knowing the secondary structure provides important information to undefirstafinding the tertiary structures and thus the functions of ncRNAs, deriving the secondary structures of ncRNAs remains an important research topic in RNA informatics.
Pseudoknot is an important structural motif in secondary structures of many types of ncRNAs. Formally, a pseudoknot occurs when an RNA has two base pairs, i  j and i'  j', such that i <i' <j <j'. Psuedoknots are known to play important functions in telomerase RNA, tmRNA, rRNA, some riboswitch, some proteinbiding RNA, Viral ribosomal frameshifting signals, etc [2]. There are 26,704 sequences in 71 ncRNA seed families of Rfam 10.0 [3] containing pseudoknots. With advances in sequencing technologies and structure prediction, more pseudoknot structures are expected to be disclosed.
Many computational methods have been used to determine the native structure of ncRNAs. A native structure is a structure that forms conformationally folding in native state before forming the tertiary structure. The gap between the free energy of the native state and other nonnative structures is often small [4]. Thus, misfolded conformations can form with high probabilities [5]. For a review of available tools, please see [6, 7].
Although there is promising progress, finding the native secondary structure is still difficult. In particular, identifying the pseudoknot, an important structural motif in many types of ncRNAs, poses a great challenge for existing methods. Predicting the minimum free energy secondary structure that includes pseudoknots has been proven to be NPhard [8]. One recent attempt is to first predict the abstract shapes (or shapes for short), which retain adjacency and nesting of structural features but disregard the length details of helix and loop regions [9]. The predicted shape will then be used to guide structure prediction. The idea of abstract shapes has long been used to characterize different types of structures. For example, most tRNAs have the cloverleaf structure; most premiRNAs have the stemloop structure; many types of pseudoknots have an Htype structure.
While the size of the folding space of an RNA sequence increases exponentially with the sequence length [10], many possible folding only differ in the details of the loop and helix regions and hence have the same abstract shape. Previous analysis shows that the space of the abstract shapes is significantly smaller than the complete folding space [11]. Knowing the abstract shape can significantly reduce the search space for structure prediction tools and improves the accuracy of structure prediction [9, 12]. The utilities of abstract shapes have been demonstrated in a number of recent publications. The Giegerich group used abstract shapes in comparative structure prediction in pseudoknotfree sequences [12]. People use shapes to aid miRNA precursor prediction in largescale studies [13, 14]. Furthermore, shapes are used to index fastexpafinding ncRNA families in Rfam [3] and lead to efficient known ncRNA search [15].
Previous work focused on shape derivation and usage for pseudoknotfree ncRNAs. There is a lack of studies of the usage of shapes in pseudoknot structure prediction. In this work, we predict the consensus shape of a group of homologous ncRNAs that may contain pseudoknots. In addition, we develop a program that uses the consensus shape for consensus pseudoknot structure prediction. A majority of existing pseudoknot structure prediction tools often have topology restrictions such as Htype, recursive Htype [16–19], kissing hairpin, or complexity levels of pseudoknot using genus numbers [20]. Therefore, using the predicted abstract shapes of input sequences can help remove the topology restriction and leads to more general and practical pseudoknot structure prediction tools. Compared with existing tools, our tool has the following properties:

While most existing shape prediction tools use a single sequence as input, we conduct comparative shape prediction on homologous ncRNAs that might contain pseudoknots. Experiments show that comparative structure or shape prediction, which derives the consensus structure or shape from a group of homologous sequences, can achieve better accuracy than using a single sequence [6, 12, 21].

We can predict the abstract shapes of both pseudoknotfree and pseudoknotcontaining sequences.

Current tools use the shape probability [22] or the sum of energies of structures to rank shapes. We use multiple features by combining wellstudied feature ranking methods and the support vector machine (SVM) method.

We demonstrate the usage of the shape by applying it to pseudoknot structure prediction. The whole software package can be directly used to derive the consensus secondary structure of homologous ncRNAs. The consensus shape prediction tool named KnotShape and the corresponding consensus pseudoknot prediction tool named KnotStructure are publicly available at our website.
We tested our software on hundreds of RNA sequence sets. The experimental results show that we can achieve 18% higher accuracy than the stateoftheart consensus shape prediction tools on pseudoknot free sequences. For pseudoknotcontaining sequences, we achieve approximate 29% higher sensitivity and 10% higher positive predictive value in structure prediction than similar tools.
Related work
Computational structure prediction can be divided into de novo structure prediction and comparative structure prediction, which derive structures from a single sequence and multiple homologous ncRNAs respectively. As our method is to derive the consensus shape and structure of homologous ncRNAs, we briefly introduce related work in comparative ncRNA structure derivation. There are three general approaches for structure derivation from multiple sequences: simultaneously align and fold, alignthenfold, and foldthenalign. It is computationally expensive to simultaneously align and fold pseudoknot structures. The performance of the alignthenfold pseudoknot prediction heavily depends on the quality of the alignment. Usually multiple sequence alignment (MSA) tools such as ClustalW [23] are used to generate the alignment as the input to the folding tool. However, common structures can be missed due to misalignment between sequences lacking significant similarity [24]. In this work, we design a pseudoknot prediction tool using the foldthenalign strategy that does not require an alignment as input. Tools based on foldthenalign use a de novo folding tool to construct a small but representative sample of the folding space, which consists of the predicted optimal and suboptimal structures. Structures from the folding space are chosen to maximize the structural and sequence similarity.
A number of software packages exist to predict the abstract shape for a single sequence. The sum of energies or the accumulated Boltzmann probabilities of all structures within a shape have been used as main features for shape prediction. The latter is often referred to as the shape probability. Usually the shapes with small sum of energies or high shape probabilities are more likely to be the correct shapes. It is claimed in RapidShapes [22] that using shape probabilities has superior performance over free energybased approach because of its independence on sequence length and base composition. However, exact computation of the shape probability incurs exponential computational cost to the sequence length [22]. Thus, various heuristics or restrictions [25, 26] have been adopted for fast shape probability computation.
RNAcast [12] derives the consensus shape from homologous pseudoknotfree sequences based on the foldthenalign strategy. Structures are grouped based on their shapes and shapes are ranked by sum of free energies of structures within the shape in ascending order. The firstranked shape is presented as the consensus shape. The consensus structure is derived from the lowest free energy structures of each sequence within the shape.
Methods
RNA structures and their representations
RNA structures and pseudoknots
RNA molecules fold into complex three dimensional structures by nitrogenous bases that are connected via hydrogen bonds. The secondary structure of an ncRNA is defined by the interacting base pairs. Some RNA molecules fold into pseudoknot structures by paring bases in loop regions with bases outside the stem loop (Figure 1a).
In this work, two types of ncRNA secondary structure representations are used. The first type is the arcbased representation, where nucleotides and hydrogen bonds are represented by vertices and arcs, respectively (Figure 1b). For pseudoknotfree secondary structures, all arcs are either nested or in parallel. Crossover arcs indicate pseudoknots. The second type is based on dotbracket notation, where '.' represents unpaired bases and matching parenthesis '(' and ')' indicate basepairing nucleotides. Following the annotation of Rfam [3], we use an extended dotbracket notation to represent pseudoknot structures. The basepairing nucleotides forming pseudoknots are represented by upperlower case character pairs, such as A..a or B..b, as shown in Figure 1c.
Abstract shapes
Abstract shapes were formally introduced by Giegerich et al. [9]. The folding space of a given RNA sequence is partitioned into different classes of structures, by means of abstracting from structural details. These classes are called abstract shapes, or shapes for short.
An RNA secondary structure can be mapped to an abstract shape with different levels of abstraction [12]. In the abstract shape, details about the lengths of the loop and stacking regions are removed (see Figure 1 for examples of stacking and loop regions). Stacking regions are represented by pairs of brackets and unpaired regions are represented by underscores.
Pseudoknots are represented by pairs of upperlower case characters. Figure 2 presents examples of the abstract shapes of level 1, 3, and 5 of a pseudoknotfree structure and a pseudoknot. Level 5 represents the strongest abstraction and ignores all bulges, internal loops, and singlestranded regions. Level 3 adds the helix interruptions caused by bulges or internal loops. Level 1 only abstracts from loop and stack lengths while retains all singlestranded regions.
Shape prediction
In this section we describe KnotShape, a comparative shape prediction tool for homologous ncRNA sequences that allows pseudoknots. The task of shape prediction is to select the best representative shape for given homologous sequences. In order to identify the best shape, various features such as shape probability [22], sum of energies of all structures in this shape [12], and the rank sum score [12] are evaluated to rank shapes. It has not been systematically assessed whether combinations of multiple features can lead to better shape prediction. In this work, we incorporate Support Vector Machine (SVM) [27] and feature selection techniques to determine important features for shape identification. In addition, we adopted a machine learningbased scoring function to evaluate the qualities of shapes.
The method contains two important components. The first one is the consensus shape prediction (KnotShape) and the second one is structure prediction using predicted shape as input (KnotStructure). We will first describe KnotShape, focusing on the feature construction and selection strategy. Then we will describe how to derive the consensus structure given the consensus shape.
Notation
Figure 3 illustrates the mapping between sequences, structures, and shapes. The input is a set of homologous ncRNAs and the output is the predicted consensus shape. Notations used in this paper correspond to this mapping.

The N homologous ncRNAs constitute the input sequence space. X_{ i }represents the i th sequence.

Each sequence can be folded into different secondary structures. Let S^{i}represent the set of folded structures of the i th sequence X_{ i }. The set of structures predicted from all N input sequences is the union of S^{i}: S = S^{1} ∪ S^{2} ∪ . . . ∪ S^{N}.

{S}_{j}^{i} is the j th structure in the folding space of X_{ i }. Its free energy is denoted by \mathrm{\Delta}G\left({S}_{j}^{i}\right). For a sequence X_{ i }, the minimum free energy MFE(X_{ i }) is the lowest free energy among the energies of all predicted structures of X_{ i }, i.e. \text{MFE}({X}_{i})={\mathrm{min}}_{1\le j\le \left{S}^{i}\right}\mathrm{\Delta}G({S}_{j}^{i}).

All structures in S can be classified into a set of abstract shapes. For a shape P, we record its associated sequences and structures. P.LX denotes the set of associated sequences, each of which can fold into a structure with shape P. P.LS denotes all structures with shape P.

\widehat{P} is the predicted shape of the given homologous sequences X_{1}, X_{2}, .., X_{ N }.
In order to explore the large folding space of multiple homologous sequences, we use a de novo folding tool to output the optimal and suboptimal structures within a given energy cutoff. This heuristic does not allow us to explore the complete folding space. Given the observation that the correct structure is usually close to the optimal structure, this heuristic works well in practice [28].
Feature construction and selection
Intuitively, the correct shape tends to possess the following properties. The correct shape should have high shape probability, meaning that a large number of structures can be classified into this shape. When we have multiple homologous sequences as input, the correct shape should be wellrepresented by all or a majority of the input sequences. Also, the ranking of the structure with the correct shape in the folding space of each sequence should be high. In addition, some structures with the correct shape have low thermodynamic energies. For the energyrelated properties, various measurements can be introduced. For example, instead of using the sum of the energies of all structures within a shape, one can use the smallest energy. Furthermore, more complicated properties such as the sequence similarity for all sequences associated with a shape P and the structural similarity of structures associated with a shape P might contribute to the shape prediction too. These similarities can be quantified using different methods such as kmers profiles, multiple sequence alignment scores, variation of base pairs and so on.
It is not trivial to decide whether a single property is enough to choose the correct shape. If not, which combination of these properties can lead to the best shape prediction performance? In order to systematically choose a set of features (i.e. properties) for shape prediction, we use Fscore [29] to measure the discrimination between a feature and its label. Given the feature vector x_{ k }, k = 1, .., m, the Fscore of the i th feature is defined as:
where n_{+} and n_{} are the numbers of positive and negative instances respectively. {\overline{x}}_{i}, {\overline{x}}_{i}^{\left(+\right)}, and {\overline{x}}_{i}^{\left(\right)} are the average values of the i th feature of the whole, positive labeled, and negative labeled data. {x}_{k,i}^{+} and {x}_{k,i}^{} are the values of i th feature of the k th positive and negative instances respectively.
Fscore reflects the discrimination of the features. The higher the Fscore, the more discriminative the feature is. Fscore is known to have a disadvantage in that it does not carry out the mutual information between features as it considers each feature separately. However, Fscore is simple and quite effective in practice.
Feature selection searches for the optimal subset of features [30]. There exist different methods for feature selection. In this work, we adopt sequential forward search (SFS) [31] because of its simplicity and effectiveness. Starting with an empty set, we iteratively select one feature at a time and add it to the current feature set. Features are selected in a descending order of the discriminative power determined by the Fscore. The feature added is the one that gives the highest accuracy.
Based on the properties that might be relevant to consensus shape prediction, we construct 17 features (the features are listed at our website) and compute the Fscore for each of them. The accuracy is evaluated using a linear SVM method. The standard grid search approach is used to find an optimal SVM parameter. The performance of a feature set is evaluated using 5fold cross validation. Prediction accuracy is the average value of all cross validation sets. The feature set that achieves the highest accuracy includes the following four features.

F1: the contribution of sequences. We capture the contribution of sequences using the number of sequences mapped to the shape. This feature reveals how the shape is shared among the homologous sequences. F 1 = P.LX.

F2: the contribution of structures. This feature represents the abundance of structures mapped to the shape. F 2 = P.LS.

F3: the average free energy. Energy model is commonly used to determine the stability of predicted structures. The basic idea behind this feature is that a stable shape is expected to be derived from a group of stable structures. F3=\frac{{\sum}_{s\in P.LS}\mathrm{\Delta}G\left(S\right)}{\leftP.LS\right}.

F4: the average of minimal free energy. This feature is different from F 3 in that it considers only the minimal free energy among all predicted structures of each sequence. F4=\frac{{\sum}_{X\in P.LX}MFE\left(X\right)}{\leftP.LX\right}.
Shape ranking using a simple scoring function
Once the features are determined, they are used together with a trained linear SVM for shape labeling. Multiple shapes might be labeled as "true". In order to rank these candidate shapes for the final shape selection, we evaluate each candidate shape using a score named sc, which is proportional to the signed distance between the candidate shape to the classification hyperplane [32]. Specifically, sc = w · x + b, where · denotes the dot product, w is the weight vector, and x is the instance vector. w is trained on the optimization function in the linear SVM. The larger w_{ j } is, the more important the j th feature is. This is restricted to w in a linear SVM model.
Time complexity of shape prediction
For N input sequences, there are S predicted structures. These structure can be grouped into P' shapes. As we use the de novo folding tools to output nearoptimal structures within a given energy range (e.g. 5%), we found that N: S: P' ≈ 1: 10: 1:375. Mapping structures to shapes takes O(SL), where L is the sequence length. As sorting shapes according to their features takes P'log(P') and P' ≤ 2N and S ≤ 11N, the procedure of shape prediction has time complexity O(NL + NlogN).
Consensus structure prediction given a shape
Once we determine the shape, we will predict the structure in the shape class for the given homologous ncRNAs. Structures corresponding to the same shape can differ significantly in the details of the loop and stacking regions. A strategy is needed to choose the correct structure inside the shape class for each input sequence. The simplest strategy is to output the MFE structure for the chosen shape, which has been used in previous work [12]. However, the MFE structure in a shape may not be the native structure. In particular, the accuracy of the MFE prediction for ncRNAs containing pseudoknots is low.
In this section we describe KnotStructure, a comparative structure prediction method for homologous sequences given the shape. The rationale behind comparative structure prediction is that the secondary structures and sequences are conserved during evolution. Thus, finding the structures to maximize both the sequence and the secondary structure similarity among homologous ncRNAs provides the basis for comparative structure prediction. Various methods for evaluating structural and sequence similarity exist. The major challenge is to efficiently select \left\widehat{P}.LX\right representative structures to achieve the highest structural and sequence similarity.
As we already derived the consensus shape \widehat{P} using KnotShape, only structures with shape \widehat{P} will be allowed. In addition, for each sequence {X}_{i}\in \widehat{P}.LX, only one structure with shape \widehat{P} can be selected. The total number of combinations of structures for measuring the similarity is thus {\prod}_{i=1\phantom{\rule{0.3em}{0ex}}to\phantom{\rule{0.3em}{0ex}}\left\widehat{P}.LX\right}\widehat{P}.LS\cap {S}^{i}, where \widehat{P}.LS\cap {S}^{i} contains structures with shape \widehat{P} for a sequence X_{ i }. Although efficient heuristics exist to measure the similarity among multiple structures and sequences, the sheer amount of combinations poses a great computational challenge.
Procedure 1 Representative structures selection
Input: \widehat{P}, \widehat{P}.LX, \widehat{P}.LS
Output: The representative structures
1. Initialization
for Every two structures {S}_{i}^{x} and {S}_{j}^{y}do
//only evaluate similarity of structures from different sequences
if x ≠ y then
Evaluate the similarity of {S}_{i}^{x} and {S}_{j}^{y}
else
{S}_{i}^{x} and {S}_{j}^{y} has similarity ∞
end if
end for
2. Select the set of representative structures using hierarchical clustering
//Each structure is a cluster by itself
repeat
Combine a pair of clusters with the highest similarity
For any structure {S}_{i}^{x} added to the cluster, remove all other structures {S}_{j}^{x} for j ≠ i
Reevaluate the similarity between clusters
until the cluster has size \left\widehat{P}.\mathsf{\text{LX}}\right
In order to efficiently select representative structures, we use a similar method to Unweighted Pair Group Method with Arithmetic Mean (UPGMA), an agglomerative hierarchical clustering technique [33]. Each object (i.e. secondary structure) starts in its own cluster. The closest pair of clusters is selected and merged into a single cluster as one moves up the hierarchy. The distance between clusters is measured using arithmetic mean defined in UPGMA. Compared to the standard clustering procedure, we have constraints on the objects that can be selected into the same cluster. Given the shape, only structures that have shape \widehat{P} and come from different ncRNAs can be combined in the same cluster. The detailed clustering process is described in Procedure 1.
During clustering, the structural and sequence similarity is evaluated using grammar stringbased approach [34, 35]. Grammar strings encode both secondary structure and sequence information for an ncRNA sequence. Grammar string alignment score can accurately quantify the structural and sequence similarity of two ncRNAs. In addition, grammar string can encode pseudoknot structures [34, 35]. For a sequence X_{ i } and one structure {S}_{j}^{i} in the folding space of X_{ i }, X_{ i } and {S}_{j}^{i} are encoded in a grammar string g{s}_{j}^{i}. We measure the similarity between any two grammar strings using the normalized grammar stringbased alignment score over the alignment length. The similarity between groups of grammar strings is measured by arithmetic mean in UPGMA.
Figure 4 sketches the representative structure selection based on clustering procedure. Let g{s}_{j}^{i} be a grammar string converted from X_{ i } and {S}_{j}^{i}, X_{ i } ∈ P.LX. Once g{s}_{j}^{i} is selected, all the other grammar strings derived from the folding space of X_{ i } will be removed from further processing.
The progressive MSA is performed on the set of representative structures using the clustering path as a guide tree. We then derive the consensus secondary structure from the alignment. The consensus structure can be mapped to each aligned sequence to accomplish the predicted structure of an individual sequence.
Running time of structure prediction
Converting a sequence and an associated secondary structure into a GS (grammar string) takes O(L^{2}), where L is the length of the sequence. Let the number of structures in \widehat{P}.LS be m. It takes O(L^{2}m) to encode all structures with shape \widehat{P}. In the first step of hierarchical clustering, we measure the similarity between GSs of different ncRNAs by conducting allagainstall comparison. Conducting pairwise GS alignment takes O(l^{2}), where l is the length of the GS sequence and l ≤ L. By using the default energy cutoff (5%) for suboptimal structure generation, we observed that m ≤ 11N. Thus, the allagainstall similarity measure has time complexity O(L^{2}N^{2}). The guide tree generated using the clustering procedure contains at most N representative structures. Thus, the total running time for clustering is O(L^{2}N^{3}), which is the leading time complexity term for the consensus structure prediction algorithm.
Experimental results
Data sets
The training data set is the K10 from BraliBASE [36]. It contains 845 sequence sets, each of which has 10 homologous ncRNAs. There are two test data sets. The first one is the K15 from BraliBASE. K15 contains 503 sequence sets, each of which has 15 homologous ncRNAs. As existing shape prediction tools are not designed for handling pseudoknots, we use the pseudoknotfree sequence sets in K15 to compare the performance of shape prediction. After removing the sets containing pseudoknots, we have 452 sequence sets left. To test the performance of pseudoknot prediction, we constructed the second test set R15 from psuedoknot families of Rfam [3]. In Rfam 10.0, there are 71 families containing pseudoknots. 25 of them have published structures. Of the 25 families, only families with at least 15 seed sequences are used for testing our tools. For each chosen family, sets of 15 sequences are chosen randomly to construct the test sets. Finally R15 contains 160 test sets. The average pairwise sequence identities range from 6093%. For all sequence sets, the reference shapes were derived from Rfam [3].
SVM training
For both the training and testing data sets, we need to apply de novo folding tools to the sequences. We choose a folding tool using the following criteria. First, this tool is able to output both the optimal and suboptimal structures. Second, this tool has high accuracy and can be efficiently applied to a large number of ncRNAs. Finally, if the target sequences contain pseudoknots, this tool should be able to output pseudoknot structures. As a result, we chose TT2NE [20]. Different from many other pseudoknot prediction tools that have constraints on the type of the pseudoknot, TT2NE is more exible about the types of the target sequences. However, when it was applied to K10, TT2NE failed to output structures for some sequences due to the length limit (200 nt) and also existence of IUPAC characters in some sequences. Thus, for the training data set K10, we applied quikfold [37] because K10 rarely contains pseudoknots. Although it is ideal to use the same folding tool to the training and testing data set to achieve optimal classification performance, the complexity of the training and test data sets together with the performance of de novo folding tools lead to the current combination. In the Discussion section we will briefly discuss how de novo folding tools affect the performance.
We employed the SVM model implemented by LIBSVM tool [38] for classification. For each sequence in K10, we applied quikfold with the energy range 5% to obtain both optimal and suboptimal structures of each sequence. The predicted structures were grouped based on their corresponding shapes. Associated features were extracted and enclosed with each shape. We normalized feature values to fit the different properties of test sets to the same scale.
To label shapes, we used the shapes extracted from the consensus structures in Rfam [3] as the reference. Shapes are labeled according to their correctness. We label a shape as 1 if it is as same as the reference shape. Otherwise, it is labeled as 1.
Shape prediction comparison
We compared KnotShape with RNAcast [12], which is part of RNAshapes package [25]. RNAcast takes the sequences as the input and predicts the consensus shape shared by all sequences. As it is not designed for pseudoknot structures, we only applied RNAcast to 452 test sets of K15, which are pseudoknotfree. TT2NE is applied to the test set using the default parameters. For each sequence, the optimal structure and 10 suboptimal structures are kept as the sample of the folding space for each sequence. We compared our predicted shapes and the firstranked shapes output by RNAcast with the reference shapes derived from Rfam [3]. The comparison is presented in Table 1. Note that RNAcast cannot output the shapes containing pseudoknots and thus is left blank for R15 in Table 1. The accuracy of KnotShape is 18% higher than RNAshapes.
Structure prediction comparison
We applied the predicted shapes to pseudoknot structure prediction and compared the structure prediction performance with IPknot [19], HxMatch [39], and TurboKnot [21], which are chosen because of their popularity, availability, and easy usage on large number of sequences. Sequence alignments were generated using ClustalW and entered as the input to IPknot and HxMatch. For IPknot, we chose the appropriate levels of prediction according to the test sets. We ran Hxmatch with the default parameters. We used the parameters suggested in [21] to run TurboKnot. Sensitivity and the Positive Predicted Value (PPV) are used to evaluate the performance:
TP is the number of correctly predicted base pairs. FN is the number of base pairs that are in the reference structure but not in the predicted structure. FP is the number of base pairs that are in the predicted structure but not in the reference structure. Figure 5 is the boxplot of the sensitivity and PPV over all 160 test sets. KnotStructure has the best overall performance on the whole data set. The median values of sensitivity and PPV are 54.55% and 46.15% for KnotStructure. Hxmatch has the next highest sensitivity and PPV (42.11% and 42.86% respectively). The abstract shapes of these families are shown in Table 2. Three families contain simple Htype pseudoknots while the other three families contain more complicated pseudoknots. In order to show the effect of shape prediction in structure prediction, we predicted the structures of R15 using 10 randomly selected shapes. The average sensitivity and PPV of predicted structures with the predicted shapes are higher than those using random shapes as shown in Table 3. Table 4 shows the average sensitivity and PPV over all sequences of each family compared to other tools. The average running time of KnotStructure on each family compared to other tools is shown in Table 5.
Discussion and conclusion
Based on the foldthenalign strategy, choice of folding tools can play an important role in the performance of the shape and structure prediction. For the test set, we tested two folding tools: HotKnots [40] and TT2NE. We used them in three different ways: Hotknots, TT2NE, and both of them. We ran HotKnots and TT2NE with default parameters. The experimental results show that using TT2NE alone achieves the best performance in consensus structure prediction. It is likely that other folding tools exist to yield better performance than TT2NE. However, as the performance of those tools also depends on the input data and the parameters, a systematic study is needed to choose the best tool.
For TT2NE, we currently only use 10 suboptimal structures. Increasing this number moderately does not affect the performance significantly. It indicates that the correct structures have high rankings in the folding space. However, there are a few sequence sets for which the correct structures are not nearoptimal. Thus, enlarging the sample folding space will likely increase the sensitivity. However, using a large number of suboptimal structures can increase the computational cost. Thus, a better algorithm is needed to achieve a better tradeoff between sensitivity and running time. This is an important part of our future work.
There are more pseudoknotfree structures available than pseudoknotcontaining structures. To achieve a reliable SVM model, more training data is desired. We used K10 for feature selection. This may cause KnotShape to have slightly lower predictive performance on pseudoknotcontaining than pseudoknotfree sequences. Nonetheless, the features used in KnotShape does not heavily rely on the free energy value, which is different between pseudoknotfree and pseudoknotcontaining structures. Instead, the feature set is based on multiple RNA properties shared among homologous sequences.
Extensive analysis of RNA properties based on SVM allows us to identify important features related to abstract shapes. The combination of mass data analysis and SVMbased feature ranking makes KnotShape a promising tool for shape prediction. By combining the predicted shapes and the multiple structural alignment strategy, KnotStructure demonstrates higher accuracy in pseudoknot structure prediction.
Declarations
The publication costs for this article were funded by NSF DBI0953738 and IOS1126998.
This article has been published as part of BMC Bioinformatics Volume 14 Supplement 2, 2013: Selected articles from the Eleventh Asia Pacific Bioinformatics Conference (APBC 2013): Bioinformatics. The full contents of the supplement are available online at http://www.biomedcentral.com/bmcbioinformatics/supplements/14/S2.
References
 1.
Gorodkin J, Hofacker IL, Torarinsson E, Yao Z, Havgaard JH, Ruzzo WL: De novo prediction of structured RNAs from genomic sequences. Trends in biotechnology. 2010, 28: 919. 10.1016/j.tibtech.2009.09.006.
 2.
Staple DW, Butcher SE: Pseudoknots: RNA Structures with Diverse Functions. PLoS Biol. 2005, 3 (6): e21310.1371/journal.pbio.0030213.
 3.
Gardner PP, Daub J, Tate J, Moore BL, Osuch IH, GriffithsJones S, Finn RD, Nawrocki EP, Kolbe DL, Eddy SR: Rfam: Wikipedia, clans and the "decimal" release. Nucleic Acids Research. 2011, 39: D141D145. 10.1093/nar/gkq1129.
 4.
Treiber DK, Williamson JR: Exposing the kinetic traps in RNA folding. Curr Opin Struct Biol. 1999, 9 (3): 33945. 10.1016/S0959440X(99)800451.
 5.
Adams A, Lindahl T, Fresco JR: Conformational differences between the biologically active and inactive forms of a transfer ribonucleic acid. Proc Natl Acad Sci USA. 1967, 57 (6): 168491. 10.1073/pnas.57.6.1684.
 6.
Gardner P, Giegerich R: A comprehensive comparison of comparative RNA structure prediction approaches. BMC Bioinformatics. 2004, 5: 14010.1186/147121055140.
 7.
Bernhart SH, Hofacker IL: From consensus structure prediction to RNA gene finding. Briefings in functional genomics & proteomics. 2009, 8 (6): 461471. 10.1093/bfgp/elp043.
 8.
Lyngs∅ RB, Pedersen CN: RNA Pseudoknot Prediction in EnergyBased Modelss. Journal of Computational Biology. 2000, 7 (34): 409427. 10.1089/106652700750050862.
 9.
Giegerich R, Voß B, Rehmsmeier M: Abstract shapes of RNA. Nucleic Acids Research. 2004, 32 (16): 48434851. 10.1093/nar/gkh779.
 10.
Schuster P, Fontana W, Stadler PF, Hofacker IL: From sequences to shapes and back: a case study in RNA secondary structures. Proceedings of the Royal Society: Biological Sciences, Series B. 1994, 255 (1344): 279284. 10.1098/rspb.1994.0040.
 11.
Scheid A, Nebel M: On abstract shapes of RNA. Tech Rep. 2008, 368: Informatik
 12.
Reeder J, Giegerich R: Consensus shapes: an alternative to the Sankoff algorithm for RNA consensus structure prediction. Bioinformatics. 2005, 21 (17): 35163523. 10.1093/bioinformatics/bti577.
 13.
Berezikov E, van Tetering G, Verheul M, van de Belt J, van Laake L, Vos J, Verloop R, van de Wetering M, Guryev V, Takada S, van Zonneveld AJ, Mano H, Plasterk R, Cuppen E: Many novel mammalian microRNA candidates identified by extensive cloning and RAKE analysis. Genome Res. 2006, 16 (10): 128998. 10.1101/gr.5159906.
 14.
Lu J, Shen Y, Wu Q, Kumar S, He B, Shi S, Carthew RW, Wang SM, Wu CI: The birth and death of microRNA genes in Drosophila. Nat Genet. 2008, 40 (3): 3515. 10.1038/ng.73.
 15.
Janssen S, Reeder J, Giegerich R: Shape based indexing for faster search of RNA family databases. BMC Bioinformatics. 2008, 9: 13110.1186/147121059131.
 16.
Huang CH, Lu CL, Chiu HT: A heuristic approach for detecting RNA Htype pseudoknots. Bioinformatics. 2005, 21 (17): 35013508. 10.1093/bioinformatics/bti568.
 17.
Cao S, Chen SJ: Predicting structures and stabilities for Htype pseudoknots with interhelix loops. RNA. 2009, 15: 696706. 10.1261/rna.1429009.
 18.
Sperschneider J, Datta A: DotKnot: pseudoknot prediction using the probability dot plot under a refined energy model. Nucleic Acids Research. 2010, 38 (7): e10310.1093/nar/gkq021.
 19.
Sato K, Kato Y, Hamada M, Akutsu T, Asai K: IPknot: fast and accurate prediction of RNA secondary structures with pseudoknots using integer programming. Bioinformatics. 2011, 27 (13): i85i93. 10.1093/bioinformatics/btr215.
 20.
Bon M, Orland H: TT2NE: a novel algorithm to predict RNA secondary structures with pseudoknots. Nucleic Acids Research. 2011, 39 (14): e9310.1093/nar/gkr240.
 21.
Seetin MG, Mathews DH: TurboKnot: rapid prediction of conserved RNA secondary structures including pseudoknots. Bioinformatics. 2012, 28 (6): 792798. 10.1093/bioinformatics/bts044.
 22.
Janssen S, Giegerich R: Faster computation of exact RNA shape probabilities. Bioinformatics. 2010, 26 (5): 632639. 10.1093/bioinformatics/btq014.
 23.
Thompson JD, Higgins DG, Gibson TJ: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, positionspecific gap penalties and weight matrix choice. Nucleic Acids Research. 1994, 22 (22): 46734680. 10.1093/nar/22.22.4673.
 24.
Wilm A, Mainz I, Steger G: An enhanced RNA alignment benchmark for sequence alignment programs. Algorithms for Molecular Biology. 2006, 1: 1910.1186/17487188119.
 25.
Steffen P, Voß B, Rehmsmeier M, Reeder J, Giegerich R: RNAshapes: an integrated RNA analysis package based on abstract shapes. Bioinformatics. 2006, 22 (4): 500503. 10.1093/bioinformatics/btk010.
 26.
Voss B, Giegerich R, Rehmsmeier M: Complete probabilistic analysis of RNA shapes. BMC biology. 2006, 4: 510.1186/1741700745.
 27.
Boser BE, Guyon IM, Vapnik VN: A training algorithm for optimal margin classifiers. Proceedings of the fifth annual workshop on Computational learning theory. 1992, New York, USA, 144152. COLT '92
 28.
Mathews DH, Sabina J, Zuker M, Turner DH: Expanded sequence dependence of thermodynamic parameters improves prediction of RNA secondary structure. Journal of molecular biology. 1999, 288 (5): 911940. 10.1006/jmbi.1999.2700.
 29.
Chen Y: Combining SVMs with various feature selection strategies. Feature Extraction: Foundations and Applications (Studies in Fuzziness and Soft Computing). 2005, SpringerVerlag
 30.
Mao KZ: Fast orthogonal forward selection algorithm for feature subset selection. IEEE Transactions on Neural Networks. 2002, 13 (5): 12181224. 10.1109/TNN.2002.1031954.
 31.
Marill T, Green D: On the effectiveness of receptors in recognition systems. Information Theory, IEEE Transactions on. 1963, 9: 1117. 10.1109/TIT.1963.1057810.
 32.
Zhang T: Fundamental Statistical Techniques, Chapter in Handbook of Natural Language Processing. 2010, Chapman and Hall
 33.
Johnson S: Hierarchical clustering schemes. Psychometrika. 1967, 32 (3): 241254. 10.1007/BF02289588.
 34.
Achawanantakun R, Takyar SS, Sun Y: Grammar string: a novel ncRNA secondary structure representation. lifesciences society org. 2010, 213.
 35.
Achawanantakun R, Sun Y, Takyar SS: ncRNA consensus secondary structure derivation using grammar strings. J Bioinformatics and Computational Biology. 2011, 9 (2): 317337. 10.1142/S0219720011005501.
 36.
Bai F, Li D, Wang T: A new mapping rule for RNA secondary structures with its applications. J Math Chem. 2008, 43: 932943. 10.1007/s1091000793031.
 37.
Zuker M, Stiegler P: Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucl Acids Res. 1981, 9: 133148. 10.1093/nar/9.1.133.
 38.
Chang CC, Lin CJ: LIBSVM: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology. 2011, 2: 27:127:27.
 39.
Witwer C, Hofacker IL, Stadler PF: Prediction of consensus RNA secondary structures including pseudoknots. IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB). 2004, 1 (2): 6677. 10.1109/TCBB.2004.22.
 40.
Ren J, Rastegari B, Condon A, Hoos HH: HotKnots: heuristic prediction of RNA secondary structures including pseudoknots. RNA. 2005, 11: 14941504. 10.1261/rna.7284905.
Acknowledgements
This work was supported by the NSF CAREER Grant DBI0953738 and NSF IOS1126998.
Author information
Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that there are no competing interests.
Authors' contributions
YS initiated the project and participated in its design and coordination. RA designed the shape prediction algorithm, developed both KnotShape and KnotStructure, and conducted the experiments. RA and YS are both responsible for writing the manuscript.
Rights and permissions
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.
About this article
Cite this article
Achawanantakun, R., Sun, Y. Shape and secondary structure prediction for ncRNAs including pseudoknots based on linear SVM. BMC Bioinformatics 14, S1 (2013). https://doi.org/10.1186/1471210514S2S1
Published:
DOI: https://doi.org/10.1186/1471210514S2S1
Keywords
 Support Vector Machine
 Positive Predicted Value
 Structure Prediction
 Support Vector Machine Model
 Unweighted Pair Group Method With Arithmetic