- Research article
- Open Access
Impact of RNA structure on the prediction of donor and acceptor splice sites
© Marashi et al; licensee BioMed Central Ltd. 2006
- Received: 10 January 2006
- Accepted: 13 June 2006
- Published: 13 June 2006
gene identification in genomic DNA sequences by computational methods has become an important task in bioinformatics and computational gene prediction tools are now essential components of every genome sequencing project. Prediction of splice sites is a key step of all gene structural prediction algorithms.
we sought the role of mRNA secondary structures and their information contents for five vertebrate and plant splice site datasets. We selected 900-nucleotide sequences centered at each (real or decoy) donor and acceptor sites, and predicted their corresponding RNA structures by Vienna software. Then, based on whether the nucleotide is in a stem or not, the conventional four-letter nucleotide alphabet was translated into an eight-letter alphabet. Zero-, first- and second-order Markov models were selected as the signal detection methods. It is shown that applying the eight-letter alphabet compared to the four-letter alphabet considerably increases the accuracy of both donor and acceptor site predictions in case of higher order Markov models.
Our results imply that RNA structure contains important data and future gene prediction programs can take advantage of such information.
- Splice Site
- Acceptor Site
- Splice Signal
- Splice Site Prediction
- Order Markov Model
In recent years, complete genomic sequences of many eukaryotic organisms are available and identifying genes in genomic DNA sequences by computational methods has become an important task in bioinformatics. Computational gene prediction tools are now essential components of every genome sequencing project. These programs generally identify potential coding regions by homology searches against databases or by identification of gene structural elements (e.g. start and stop positions and donor and acceptor splice sites) in an unknown DNA sequence. The latter task is routinely done using algorithms trained by observed signals in sequences of known structure.
Ab initio gene prediction methods are based on searching for splice site signals in genomic sequences. The 5' boundary or donor sites of introns in eukaryotes almost always contain the dinucleotide GU, while the 3' boundary or acceptor sites contain the dinucleotide AG. However, because of the common occurrences of these conserved dinucleotides, correct detection of splice sites is not possible if the gene finding algorithm is merely based on the GU-AG rule. Unfortunately, signals around these sites (and especially acceptor signals) are not strictly conserved.
Different methods have been developed for splice site detection, including probabilistic models, neural networks and support vector machines, and techniques based on statistical analyses [1, 2]. These methods fundamentally seek conserved motifs or features surrounding the splice sites in training datasets containing known real and decoy (non-real) splice sites. They are generally different in the way that they recognize the dependencies between different positions within a signal sequence. Generally, if we take only the splice signal into account for exon/intron boundary determination, we may obtain many incorrectly predicted (false) splice sites.
In eukaryotes, the vast majority of splicing processes are catalyzed by the spliceosome complex, which has been estimated to contain several hundred different proteins in addition to different snRNAs. These factors are responsible for accurate positioning of the spliceosome on the 5' and 3' splice site sequences . Different experimental evidence suggests that RNA secondary structure can affect the splicing process (see  and references therein). In addition, it has been suggested that RNA structure prediction can aid the prediction of human acceptor sites  and yeast donor and acceptor sites .
Patterson and coworkers  applied decision trees and support vector machines as standard machine learning approaches, to improve the prediction of acceptor sites with the consideration of structure metrics (e.g. structure free energy and "maximum helix forming probability") calculated from folding of 100-nucleotide windows around each site/non-site. They reported that consideration of such metrics can result in subtle but significant improvements in the prediction of acceptor sites, while the role of these metrics in the prediction of donor sites was reported to be insignificant.
Our group recently applied neural networks to investigate whether addition of RNA secondary structure information can improve yeast donor and acceptor splice site predictions . We predicted pre-mRNA secondary structures for each "gene" (starting from an AUG and ending in a stop codon). We then converted the structure to a string of two alphabet symbols: stem (S) and loop (L). Then, we combined these symbols and the four-letter alphabet of nucleotides (A, G, C, U) into an eight-letter alphabet. It was found that both donor and acceptor site predictions based on eight-letter alphabet are noticeably more successful compared to the predictions based on the four-letter alphabet. Our results suggest that eight-letter alphabet contains important information (detected by the networks) which is not present in the four-letter alphabet.
In this study, using Markov models of different orders, we investigated whether the addition of RNA structure information positively influences the accuracy of eukaryotic donor and acceptor site predictions. We first predicted the RNA secondary structure for a 900-base window centered on each splice site, and each non-site (decoy site) and translated it into the eight-letter alphabet, similar to our previous work. Zero-, first- and second-order Markov models were applied for the four-letter and eight-letter alphabets. To demonstrate the accuracy and efficiency of the proposed method, a leave one out cross validation test was performed for each dataset. Our results indicate that when a combination of sequence and structure, i.e. the eight-letter alphabet, is applied to predict splice sites by Markov models, the accuracy of prediction considerably improves. Interestingly, this phenomenon is recognizable in a variety of plant and vertebrate datasets. Therefore, we propose that this approach can be extended to other splice site prediction programs.
Why 900-nucleotide sequences were chosen to feed the RNA structure prediction program?
It is practically impossible to predict the structure of full-length pre-mRNAs in higher eukaryotes because of their large sizes and time limitations. Instead, we chose to select a "window" around each site to feed the RNA structure prediction program.
RNA structure prediction improves splice site prediction accuracy
After prediction of RNA structures of 900-base sequences around each splice site, we translated the normal RNA sequences to eight-letter sequences based on whether or not each nucleotide was in a stem. Then we trained zero-, first- and second-order Markov models with conventional sequence and with eight-letter sequences for prediction of donor and acceptor sites.
Comparison of eight-letter vs. four-letter predictions of acceptor and donor sites for different datasets. Where application of eight-letter alphabet enhances the prediction compared to the conventional four-letter alphabet, the data pair is shown in bold.
There are different factors that influence the importance of predicted RNA structure for splice signal detection with different orders of Markov models. First, the number of observations for each dataset at each position of splice signal decreases when higher order Markov models are applied. Thus, the randomness of the training datasets may negatively influence the prediction accuracy. In addition, since RNA base-pairing often occurs between continuous runs of nucleotides longer than 2–3 nucleotides, a zero-order Markov model (which assumes no dependencies between positions) cannot perfectly take the structural information into account. In contrast, the prediction accuracies of first-, and more effectively, second-order Markov models enhance notably.
Since the improvements obtained with the application of eight-letter instead of four-letter alphabet is generally small, it is necessary to verify the observed deteriorations and improvements are statistically significant. As explained in the Methods section, we calculated p-values for test of differences in these quantities. Very few cases showed insignificant differences, which means that the observed differences are far from being produced by chance.
In our study, AraClean dataset can be considered as an example of small training datasets, which is usually the case when studying novel genomes; BG570 and HMR195 are examples of genes with poorly conserved signals. Also, note that for the two smallest datasets (i.e. AraClean and HMR195), the improvement is more obvious. For the above datasets, the success of application of eight-letter alphabet in splice site prediction implies that the structure around splice sites are preserved enough to be useful in prediction.
Log likelihood ratios show conservation of structure at splice sites
It is well-known that in living systems, RNA molecules may fold differently from what is predicted by computational methods. With the best possible prediction software, we completely ignore the importance of RNA-binding proteins in the formation of RNA structures. Nevertheless, if the RNA secondary structure is important as a signal, one can expect preserved structural patterns to be present in the signal sequences, particularly when several previous reports insist on the existence of such structural patterns.
One may argue about the impact of RNA structure per se on the splice site prediction. For example, it is previously reported that in case of noncoding RNAs, the distinct statistical properties result mostly from local base-composition bias and not from RNA structure .
Table 1 shows that when zero-order Markov model is used, predictions based on eight-letter alphabet generally worsen the splice site identification compared to the four-letter alphabet. In contrast, applying the first-order Markov model fairly improves eight- vs. four-letter splice site predictions, while the use of the second-order Markov model remarkably improves them. If the observed improvements had been simply resulted from the structural differences caused by GC content variations between real and decoy sites, one could have expected to observe the improvements in case of Markov models of any order. Our results imply that the secondary structure information in adjacent nucleotides is in fact the factor that improves the eight-letter-based predictions.
We considered a 21-nt window around each donor or acceptor site, assuming that this window includes all information-containing positions. Figure 3 implies that this cannot be absolutely correct, since far away positions clearly contain species-specific signals. For our datasets, we extended the splice signal window 5 nucleotides from each side. When eight-letter alphabet was applied, predictions of splice sites with this 31-nt window were slightly more successful in comparison with the previous predictions. Altogether, we concluded that the size of the window marginally influences the prediction of splice sites. This is in contrast with four-letter-based predictions, since the information content reduces to zero for distant positions relative to the conserved GU/AG.
Optimization of RNA structure prediction software for gene prediction: a must?
In this work, we used Vienna software  to predict the structure of real and decoy RNA molecules in our datasets. In previous works, Mfold  has been exploited to predict RNA structures , . The success of these studies suggests that future gene prediction programs may incorporate RNA structure prediction modules. However, the RNA structure prediction programs might not act ideally for gene prediction software, because these programs are designed to find the structure with the least free energy and they test all possible secondary structures; as a result, they are too slow and are not suitable to be associated with gene prediction in genomic sequences, in which a lot of sites should be tested. Therefore, a rapid but approximate structure prediction algorithm might be more useful. Moreover, these programs work best for short sequences and they should be revised to perform better for longer RNA molecules . There are also other algorithms and strategies to predict RNA structure . One should check whether these programs are more useful to be associated with gene prediction programs. Optimized algorithms for RNA structure prediction may significantly improve current gene prediction software.
RNA secondary structure prediction
The Vienna RNA package  was used to predict the most stable RNA fold for each sequence. The RNAfold program in the package predicts the minimum free energy structure of a single sequence, based on the algorithm originally developed by Zuker and Stiegler . The predicted structures were converted to a string of two-symbol alphabet (i.e. S, L) corresponding to whether each nucleotide is paired or unpaired, respectively. Then, with the combination of L and S symbols and four-letter nucleotide alphabet (i.e. A, U, C, G), each sequence was converted to an eight-letter alphabet sequence. The nucleotide sequences of splice sites (four-letter) and the sequence-structure combination strings (eight-letter) were used for training Markov models (see below).
To evaluate the performance of splice site prediction and comparison of primary sequence vs. prediction based on the combination of sequence and structure, we used some well-known non-redundant datasets with standard donor GUs and acceptor AGs: AraClean dataset with 144 A. thaliana genes ; AtGS and HsGS datasets with 1323 A. thaliana and 1115 H. sapiens genes respectively ; BG570 dataset with 570 vertebrate genes ; and HMR195 dataset with 195 human, mouse and rat genes . In addition, for each donor or acceptor site, 2 GUs and 2 AGs other than the splice site were randomly selected from each dataset (to construct our non-real or "decoy" datasets). In case of each real or decoy site, a 900-base sequence centered at the invariant GU or AG dinucleotides was extracted from the above-mentioned datasets (see below).
Patterson et al  selected 100-nucleotide sequences centered at each GU or AG dinucleotide, but this might not be the best choice. In a real enormous pre-mRNA molecule in eukaryotes, it is logical to assume that there are many faraway nucleotides base-paired to each other to form secondary structures. We selected 900-nt sequences centered at each real/decoy site; then the RNA secondary structures were predicted for these "windows" (see Results and Discussion).
Positional Markov models
For devising a positional Markov model, we extracted local 21-nt windows surrounding the candidate splice sites. These local contexts consist of four adjacent nucleotides upstream and fifteen adjacent nucleotides downstream the GU for donor sites. Fifteen adjacent nucleotides upstream and four adjacent nucleotides downstream the AG sites were considered in case of acceptor sites. These segments around donor and acceptor sites are modeled by separate Markov models where the observed state variables are the elements drawn from the four-letter alphabet, or alternatively from the eight-letter alphabet.
We applied zero-, first- and second-order Markov models [18, 19]. Briefly, in an n th-order Markov model the probability of the observation of a character in the i th position depends merely on the characters in its n previous positions.
We applied zero, first and second order Markov models. For example, Given a sequence x = x1x2...xl-1x l , the first order Markov model is such that:
in which P1(x1) and Pi-1i(x i |xi-1) refer to the probability of x1 at the first position and the conditional probability of x i at position i given that xi-1is at position i-1, respectively. In second order Markov model, each symbol depends on the value of the two preceding symbols. The zero order (positional) Markov model is simply a positional weight matrix , and probability of each symbol is independent of the other positions. In order to distinguish the false splice sites consisting of the conserved GU and AG dinucleotides, we define a false model M- to characterize the signal segments for false splice sites. To use these models for discrimination, we calculated the score as:
This model was applied both for the four-letter and the eight-letter alphabet sequences.
Considering the two-letter alphabet of structure (i.e. L and S), we defined log likelihood ratio (LLR) of "Loops" as:
LLR = log2 (fr,l/fd,l) (3)
in which fr,l is the frequency of "loops" (i.e. letter L) at the l th position of real sites and fd,l is the frequency at the l th position of decoy sites. Positive LLR values indicate that the l th nucleotide in the window is placed in loops more than what is expected by chance; the reverse is true for negative values.
Since each nucleotide in the real and decoy datasets is folded either as a "loop" or a "stem", performing a "test of two binomial proportions" allows us to see whether the difference between the L/(L+S) proportions of real and decoy sites is statistically significant. This test was performed using MINITAB© 14 software. A p-value less than 0.05 was considered significant.
Sensitivity (Sn) and specificity (Sp) as common measures for determining the accuracy of prediction methods  were calculated as:
Sn = TP/(TP + FN) (4)
Sp = TP/(TP + FN) (5)
where TP is the number of true positives, FN is the number of false negatives, TN is the number of true negatives and FP is the number of false positives. Sp is proportion of predicted real sites that are actually real, while Sn is the proportion of real sites that have been correctly predicted as real. Since neither Sp nor Sn alone constitutes good measures of global accuracy, other measures are developed. The preferred measure for global accuracy which has traditionally been used is correlation coefficient, defined as:
Leave one out cross validation analysis
For each dataset, a leave one out cross validation (LOOCV) analysis was performed, i.e. each site (real or decoy) was removed and the remaining sites were used to train the Markov models and to score (to test) the removed site. In case of each Markov model, using the above scores, a fixed cutoff value was chosen for each dataset in all iterations of the LOOCV tests, so as to maximize the discrimination between real and decoy sites by maximizing CC.
In our study, it is important to see whether the application of the eight-letter alphabet results in improvements in the splice signal predictions compared to the conventional four-letter alphabet, and whether the (probable) improvements are statistically significant. To test the significance of the observed differences in the performance measures, for each dataset (real or decoy) we left one sequence out at a time. Then, based on the above mentioned cutoff value, TP, TN, FP and FN were determined. Using Equations (4), (5) and (6), the Sn, Sp and CC values were calculated. With this procedure we obtained distributions for CC, Sn and Sp values for each model. These distributions were then used to investigate whether the observed differences were significant. The level of significance was considered as p < 0.001 in the Mann-Whitney test for the difference in the medians of the distributions of four- vs. eight-letter-based performance measures. MINITAB© 14 was used to perform the analysis.
We thank H. Shateri Najafabadi and H. Goodarzi (Department of Biotechnology) and A. Katanforoush (Institute of Biochemistry and Biophysics) for their assistance and useful comments.
- Mathé C, Sagot MF, Schiex T, Rouzé P: Current methods of gene prediction, their strengths and weaknesses. Nucleic Acids Res 2002, 30: 4103–4117. 10.1093/nar/gkf543PubMed CentralView ArticlePubMedGoogle Scholar
- Brent MR, Guigó R: Recent advances in gene structure prediction. Curr Opin Struct Biol 2004, 14: 264–272. 10.1016/j.sbi.2004.05.007View ArticlePubMedGoogle Scholar
- Staley JP, Guthrie C: Mechanical devices in the spliceosome: Clocks, motors, springs and things. Cell 1998, 92: 315–326. 10.1016/S0092-8674(00)80925-3View ArticlePubMedGoogle Scholar
- Buratti E, Baralle FE: Influence of RNA secondary structure on the pre-mRNA splicing process. Mol Cell Biol 2004, 24: 10505–10514. 10.1128/MCB.24.24.10505-10514.2004PubMed CentralView ArticlePubMedGoogle Scholar
- Patterson DJ, Yasuhara K, Ruzzo WL: Pre-mRNA secondary structure prediction aids splice site prediction. Pac Symp Biocomput 2002, 7: 223–234.Google Scholar
- Marashi SA, Goodarzi H, Sadeghi M, Eslahchi C, Pezeshk H: Importance of RNA secondary structure information for yeast donor and acceptor splice site predictions by neural networks. Comput Biol Chem 2006, 30(1):50–57. 10.1016/j.compbiolchem.2005.10.009View ArticlePubMedGoogle Scholar
- Chen S, Anderson K, Moore MJ: Evidence for a linear search in bimolecular 3' splice site AG selection. Proc Natl Acad Sci USA 2000, 97: 593–598. 10.1073/pnas.97.2.593PubMed CentralView ArticlePubMedGoogle Scholar
- Rivas E, Eddy SR: Secondary structure alone is generally not statistically significant for the detection of noncoding RNAs. Bioinformatics 2000, 16: 583–605. 10.1093/bioinformatics/16.7.583View ArticlePubMedGoogle Scholar
- Hofacker IL, Fontana W, Stadler PF, Bonhoeffer S, Tacker M, Schuster P: Fast folding and comparison of RNA secondary structures. Monatshefte Für Chemie 1994, 125: 167–188. 10.1007/BF00818163View ArticleGoogle 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
- Najafabadi HS, Goodarzi H, Torabi N, Banihosseini SS: Applying a neural network to predict the thermodynamic parameters for an expanded nearest-neighbor model. J Theor Biol 2006, 283(3):657–665. 10.1016/j.jtbi.2005.06.014View ArticleGoogle Scholar
- Gardner PP, Giegerich R: A comprehensive comparison of comparative RNA structure prediction approaches. BMC Bioinformatics 2004, 5: 140. 10.1186/1471-2105-5-140PubMed CentralView ArticlePubMedGoogle Scholar
- Zuker M, Stiegler P: Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Res 1981, 9: 133–148.PubMed CentralView ArticlePubMedGoogle Scholar
- Korning PG, Hebsgaard SM, Rouzé P, Brunak S: Cleaning the GenBank Arabidopsis thaliana data set. Nucleic Acids Res 1996, 24: 316–320. 10.1093/nar/24.2.316PubMed CentralView ArticlePubMedGoogle Scholar
- Pertea M, Lin X, Salzberg SL: Genesplicer: a new computational method for splice site prediction. Nucleic Acids Res 2001, 29: 1185–1190. 10.1093/nar/29.5.1185PubMed CentralView ArticlePubMedGoogle Scholar
- Burset M, Guigó R: Evaluation of gene structure prediction programs. Genomics 1996, 34: 353–367. 10.1006/geno.1996.0298View ArticlePubMedGoogle Scholar
- Rogic S, Mackworth AK, Ouellette BFF: Evaluation of gene-finding programs on mammalian sequences. Genome Res 2001, 11: 817–832. 10.1101/gr.147901PubMed CentralView ArticlePubMedGoogle Scholar
- Zhang MQ, Marr TG: A weight array method for splicing signal analysis. Comput Appl Biosci 1993, 9: 499–509.PubMedGoogle Scholar
- Staden R: Computer methods to locate signals in nucleic acid sequences. Nucleic Acids Res 1984, 12: 505–519.PubMed CentralView ArticlePubMedGoogle Scholar
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.