ORIGINAL RESEARCH article

Front. Genet., 25 October 2018

Sec. Computational Genomics

Volume 9 - 2018 | https://doi.org/10.3389/fgene.2018.00495

M6AMRFS: Robust Prediction of N6-Methyladenosine Sites With Sequence-Based Features in Multiple Species

  • 1. Institute of Computing Science and Technology, Guangzhou University, Guangzhou, China

  • 2. School of Computer Science and Technology, Tianjin University, Tianjin, China

  • 3. Department of Computer Science, University of Tsukuba, Tsukuba, Japan

  • 4. School of Software, Tianjin University, Tianjin, China

Abstract

As one of the well-studied RNA methylation modifications, N6-methyladenosine (m6A) plays important roles in various biological progresses, such as RNA splicing and degradation, etc. Identification of m6A sites is fundamentally important for better understanding of their functional mechanisms. Recently, machine learning based prediction methods have emerged as an effective approach for fast and accurate identification of m6A sites. In this paper, we proposed “M6AMRFS”, a new machine learning based predictor for the identification of m6A sites. In this predictor, we exploited a new feature representation algorithm to encode RNA sequences with two feature descriptors (dinucleotide binary encoding and Local position-specific dinucleotide frequency), and used the F-score algorithm combined with SFS (Sequential Forward Search) to enhance the feature representation ability. To predict m6A sites, we employed the eXtreme Gradient Boosting (XGBoost) algorithm to build a predictive model. Benchmarking results showed that the proposed predictor is competitive with the state-of-the art predictors. Importantly, robust predictions for multiple species by our predictor demonstrate that our predictive models have strong generalization ability. To the best of our knowledge, M6AMRFS is the first tool that can be used for the identification of m6A sites in multiple species. To facilitate the use of our predictor, we have established a user-friendly webserver with the implementation of M6AMRFS, which is currently available in http://server.malab.cn/M6AMRFS/. We anticipate that it will be a useful tool for the relevant research of m6A sites.

Introduction

To date, more than 150 types of RNA modifications have been discovered (; ). Of these modifications, N6-methyladenosine (m6A) is the most common and abundant one and exists in various species. It is found to be closely associated with diverse biological processes, such as RNA localization and degradation (), RNA structural dynamics (), alternative splicing (), primary microRNA processing (), cell differentiation, and reprogramming (), and regulation of circadian clock (). Thus, identification of m6A sites is of great importance for better understanding of their functional mechanisms. In the past few years, high-throughput experimental methods, such as MERIP () and m6A-seq (), have been utilized to identify m6A modifications, and more and more m6A peaks have been characterized. However, they have the following limitations: (1) they cannot accurately locate the positions of m6A sites; (2) they are highly cost; and (3) they are not applicable for the large-scale identification of m6A sites. Hence, it is highly desirable to develop fast and accurate computational methods for the identification of m6A sites (, ).

In recent years, machine learning based prediction methods have emerged as effective approach for predicting m6A sites. For example, developed the first machine learning based predictor, called “iRNA-Methyl”, for m6A site identification. They exploited physicochemical properties and sequence-order information embedded in PseDNC (pseudo dinucleotide composition) (), and used support vector machine for model construction. Later, proposed to incorporate more additional physicochemical properties coupled with a scalable transformation algorithm into their feature extraction model. To improve the predictive performance, Jia et al. proposed to fuse three types of feature descriptors, such as bi-profile Bayes, dinucleotide composition and KNN scores. Their results showed that this fusion strategy is able to achieve better performance than single one feature descriptor (). Similarly, found that combining binary encoding scheme together with k-mer frequency could contribute to the improved performance. Recently, developed “SRAMP”, a powerful prediction tool using multiple types of feature descriptors, including positional binary encoding of nucleotide sequence, k-nearest neighbor encoding, nucleotide pair spectrum encoding, and secondary structure pattern, to train an ensemble predictive model with random forest for the identification of m6A sites. SRAMP is reported to achieve relatively good performance as compared to other predictors. More recently, proposed a new predictor called “RNAMethyPre”, using compositional information and position-specific information to build predictive models for the prediction of m6A sites on both human and mouse. Additionally, in our previous study, we proposed to use deep learning algorithm to generate high-latent features to improve the predictive performance (). However, we found that most of existing predictors are species-specific. Currently, there is not any predictor that is capable of predicting m6A sites for multiple species.

For this purpose, we proposed a novel sequence-based predictor, namely “M6AMRFS” for detecting m6A sites in RNA sequences. For feature extraction (, ), we proposed a feature representation algorithm to encode sequences with dinucleotide binary encoding and local position-specific dinucleotide frequency. To optimize the feature space, we combined the F-score algorithm with SFS (Sequential Forward Search) (,,) to improve the representation ability of our features. For model training, we trained the optimal feature representations under XGBoost algorithm. Our experimental results showed that the proposed M6AMRFS is able to achieve competitive and robust performance as compared to state-of-the-art predictors for four different species. To the best of our knowledge, this is the first predictor that is applicable for multiple species. Furthermore, we have established a user-friendly webserver that implements the proposed M6AMRFS, which is currently available in http://server.malab.cn/M6AMRFS/. We anticipate that it will be a useful tool complementary for existing tools, facilitating to further reveal the functional mechanisms of m6A sites.

Materials and Methods

Benchmark Datasets

To predict the m6A sites in multiple species, we employed four benchmark datasets from four species, including Saccharomyces cerevisiae, Arabidopsis thaliana, Musculus, and Homo sapiens. The detail of the four benchmark datasets is listed in Table 1. For the four benchmark datasets, the positives are the sequences centered with true m6A sites, while the negatives are usually the sequences centered with adenines but without any m6A peaks detected. The datasets can be found in the following website: http://server.malab.cn/M6AMRFS/.

Table 1

DatasetsSpeciesPositivesNegativesTotalSequence lengthReference
Dataset-S51Saccharomyces cerevisiae13071307261451 nt
Dataset-H41Homo sapiens11301130226041 nt
Dataset-M41Musculus725725145041 nt
Dataset-A101Arabidopsis thaliana100010002000101 nt

Summary of the benchmark datasets from four species.

Prediction Framework of the Proposed Predictor

Figure 1 illustrates the overall procedure of the proposed predictor. As we can see from Figure 1, there are two steps in the predictor. The first step is data pre-processing, including data clean and feature extraction. It filters out those irrelevant sequences from input sequences. Then, the resulting sequences are submitted into the feature representation algorithm, in which the sequences are encoded with feature vectors. The second step is feature optimization and model training. For feature space optimization, we used the F-score algorithm combined with SFS (Sequential Forward Search) to search for the optimal features. Afterward, the resulting optimal feature representations are fed into a well-trained XGBoost model to predict whether the sequences are true m6A sites or not. In our predictor, the predicted outcome for each sequence is 0 or 1, where 0 denotes non-m6A site and 1 denotes true m6A site.

FIGURE 1

Feature Representation

In this work, we present a new feature representation algorithm that combines two feature descriptors. One is named “Dinucleotide binary encoding” and the other is “Local position-specific dinucleotide frequency”, which are described as follows,

Dinucleotide Binary Encoding

The feature descriptor encapsulates the positional information of the dinucleotide at each position in the sequence. Obviously, there are a total of 16 possible dinucleotides. In this descriptor, each dinucleotide can be encoded into a 4-dimensional 0/1 vector. For example, AA is encoded as (0,0,0,0); AT is encoded as (0,0,0,1); AC is encoded as (0,0,1,0); and so forth, GG is encoded as (1,1,1,1). Therefore, using the dinucleotide binary encoding, we yielded a 160 (=404)-dimensional 0/1 vector for the given sequence.

Local Position-Specific Dinucleotide Frequency

For a given sequence, the feature vector of this descriptor can be denoted as (f2, f3, …, fl), where fi is calculated as follows,

where l is the length of the given sequence, |Ni| is the length of the ith prefix string {X1X2…Xi} in the sequence, and C (Xi-1Xi) is the occurrence number of the dinucleotide Xi-1Xi in position i of the ith prefix string.

Feature Selection

Feature selection is an important process to improve the classification performance (; ; ; ,; ). Here, we used the F-score algorithm together with the SFS strategy to search the most discriminative features (). Figure 2 illustrates the procedure of the feature selection strategy, which is described as follows. Firstly, the F-score algorithm is utilized to rank all the features from the highest scores to the lowest scores, generating a ranked feature list. Secondly, we added the features one by one from the ranked list, and respectively trained the predictive models. Lastly, the feature subset corresponding to the highest accuracy of the predictive model is used as the optimal features. The results of feature selection were discussed in section of “Results and Discussion”.

FIGURE 2

XGBoost (eXtreme Gradient Boosting)

eXtreme Gradient Boosting, which was proposed by , has been shown to be a powerful classification algorithm. The general idea of XGBoost is to enumerate several candidates that may be the segmentation points according to the percentile method, and then to find the best segmentation point from the candidates for calculating the segmentation points. The main advantage of XGBoost is to combine multithreading, data compression, and fragmentation methods to improve the efficiency of the algorithm as much as possible. Moreover, the regularization terms added by XGBoost in the loss function can be used to control the complexity of the model and avoid overfitting. Parameters, such as subsamples, max depth, and estimators, are utilized to optimize evaluation performance via parallelization program namely “Grid Search”. For the implementation of XGBoost in our predictor, the range of max depth is set from 2 to 10; learning rate is ranged from 0.1 to 0.8; and estimators are ranged from 1 to 10.

Performance Evaluation

In this work, four commonly used performance metrics are used for performance evaluation, including Acc (accuracy), Sn (sensitivity), Sp (specificity), and MCC (Mathew’s correlation coefficient), respectively (; ; ; ; ; ; ; ). They are formulated as follows

where TP denotes true positive; TN denotes true negative; FP denotes false positive; and FN denotes false negative. Sn measures the predictive ability of a predictor for positive samples while Sp measures the predictive ability of a predictor for negative samples. Acc and MCC are two metrics measuring the overall performance of a predictor.

Besides, we used Receiver Operating Characteristic (ROC) curve to intuitively evaluate the overall performance (, ). It is plotted with true positive rate (TPR) against false positive rate (FPR) under different classification thresholds. The TPR is the same with sensitivity as described above, while FPR is calculated as 1-specificity. Area under ROC curve (AUC) is usually used as an evaluation metric (, ). The value of AUC ranges from 0.5 to 1. If the AUC is close to 1, it indicates that the predictor has excellent performance. If the AUC approaches to 0.5, the predictor does not perform well for prediction.

Additionally, we used 10-fold cross validation method and jackknife test to evaluate the predictive performance (; ,; ; ). The two evaluation methods were chosen since existing methods in the literature used them for performance evaluation.

Results and Discussion

Comparison of XGBoost and Other Classifiers

To evaluate the effectiveness of the XGBoost classifier, we compared it with five commonly used machine learning algorithms, including Random Forest (RF) (; ; ), Naïve Bayes (NB), Logistic Regression (LR), K-Nearest Neighbors (KNN)(), Support Vector Machine (SVM) (, , ; ; ), and Gradient Boosting Decision Tree (GBDT) (), respectively. For fair comparison, the machine learning algorithms were trained and evaluated with 10-fold cross validation on the benchmark datasets, respectively. The performance of different classifiers is illustrated in Figure 3. The detailed results are presented in Table 2.

FIGURE 3

Table 2

Dataset-S51AccSnSpMCCDataset-H41AccSnSpMCC
GBDT0.72340.72000.72690.4468GBDT0.90890.82040.99730.8308
KNN0.61670.73370.49960.2400KNN0.65660.40620.90710.3620
LR0.71920.69240.74600.4390LR0.90660.82040.99290.8257
NB0.70500.71000.70010.4101NB0.81550.63270.99820.6779
RF0.71650.71920.71380.4331RF0.89820.79651.00000.8135
SVM0.72570.71690.73450.4515SVM0.90180.80351.00000.8195
XGBoost0.73140.73450.72840.4629XGBoost0.90890.81950.99820.8311
Dataset-M41AccSnSpMCCDataset-A101AccSnSpMCC
GBDT0.88900.77791.00000.7979GBDT0.77950.76240.79670.5594
KNN0.64480.43030.85930.3207KNN0.66380.75240.57520.3329
LR0.88070.77930.98210.7775LR0.79140.79100.79190.5829
NB0.78620.57930.99310.6288NB0.75170.80050.70290.5057
RF0.88900.77791.00000.7979RF0.72600.71520.73670.4520
SVM0.88480.77660.99310.7884SVM0.79710.79570.79860.5943
XGBoost0.88900.77791.00000.7979XGBoost0.78900.78240.79570.5781

Performances of XGBoost and other machine learning algorithms.

As shown in Table 2 and Figure 3, XGBoost outperforms the other classifiers on three out of the four datasets, with the exception of Dataset-A101, for which the SVM classifier is slightly better than the XGBoost, which is the second best among the compared classifiers. For those datasets that the XGBoost outperforms other classifiers, the XGBoost is able to achieve higher Acc and MCC. To be specific, our Acc and MCC are 0.7314 and 0.4629 in the Dataset-S51, 0.6 and 1.1% higher than that of the runner-up SVM. Similar results are observed in the Dataset-H41; XGBoost leads by 0.71 and 1.2% in terms of Acc and MCC, respectively. Moreover, in the Dataset-M41, the performances of our XGBoost are the same with the RF and GBDT in terms of Acc, Sn, Sp, and MCC, respectively. In summary, our results demonstrate that as compared to other commonly used classifiers, the XGBoost shows generally better and more robust performance to classify true m6A sites to non- m6A sites from different species.

Impact of Feature Selection

In this study, we employed the F-score with the SFS for feature selection. The results of feature selection are summarized in Table 3 and illustrated in Figure 4 as well. As seen from Table 3, before feature selection, the performances of the predictive model in the Dataset-S51 are 0.7314, 0.7345, 0.7284, and 0.4629 in terms of Acc, Sn, Sp, and MCC, respectively. After applying the feature selection, we observed that the performances in terms of all the metrics were improved. To be specific, the Acc and MCC were improved to 0.7425 and 0.4852, respectively. This indicates that the feature selection strategy to yield more informative features to distinguish true m6A sites from non-m6A sites. For the other datasets from different species, similar results were observed. We can see from Table 3 that almost all the performances were improved by using feature selection, demonstrating that feature selection is an effective way to enhance the predictive performance of the predictor. Moreover, Figure 4 illustrates the Acc of the features by varying the feature number when conducting feature selection. As seen in Figure 4, we pointed out the optimal feature number and their corresponding highest Acc for each dataset. The optimal feature number for the four datasets are 85, 57, 13, and 355, giving the highest Acc of 0.7425, 0.9102, 0.8924, and 0.8105, respectively.

Table 3

DatasetsMethodsAccSnSpMCC
Dataset-S51Before0.73140.73450.72840.4629
After0.74250.75210.73300.4852
Dataset-H41Before0.90890.81950.99820.8311
After0.91020.82041.00000.8339
Dataset-M41Before0.88900.77791.00000.7979
After0.89240.78900.99590.8022
Dataset-A101Before0.78900.78240.79570.5781
After0.81050.80670.81430.6210

Performance of features before and after feature selection.

FIGURE 4

Comparison With Other Feature Representation Algorithms

To examine the performance of the proposed feature algorithm, we evaluated and compared it with existing feature representation algorithms, including RFH, PseDNC, PCP (physical and chemical properties), KNN (K-Nearest Neighbors), and AthMethPre, respectively. These algorithms were reported to have relatively strong power for the identification of m6A sites. Thus, they were chosen for comparison. The results of the above algorithms were presented in Table 4. As we can see from Table 4, the proposed features are competitive with the best-performing AthMethPre other feature representation methods and remarkably outperform the other existing features in all the four datasets. Note that for the Dataset-S51 and the Dataset-A101, our method performs slightly worse than the best-performing AthMethPre; while for the other two datasets, our method is slightly better. As well known, for the genome-wide identification, the running time for a predictor is important as well. Therefore, we further compared the feature number of AthMethPre and our feature representation method. We found that the feature number of the AthMethPre method for each dataset are 540, 500, 500, and 740, while ours are 85, 57, 13, and 355, respectively. As can be seen, our feature numbers for all the four datasets are averagely much fewer than the AthMethPre method. This indicates that the computation time by our predictive models costs less. In general, it can be concluded that our features are at least effective for the representatives of m6A sites in multiple species with different sequence lengths.

Table 4

Dataset-S51AccSnSpMCCDataset-H41AccSnSpMCC
RFH0.72950.75820.70080.4598RFH0.90970.819510.8332
PseDNC0.640.69930.58070.282PseDNC0.69560.59730.79380.3989
PCP0.6270.63890.61510.2541PCP0.64470.61770.67170.2898
KNN0.71310.69170.73450.4266KNN0.82350.73630.91060.657
AthMethPre0.75360.76050.74670.5073AthMethPre0.90710.814210.8286
Our features0.74250.75210.7330.4852Our features0.91020.820410.8339
Dataset-M41AccSnSpMCCDataset-A101AccSnSpMCC
RFH0.89030.78480.99590.7987RFH0.79930.77050.82810.5996
PseDNC0.62280.63860.60690.2456PseDNC0.81380.80570.82190.6277
PCP0.61660.56690.66620.2343PCP0.82570.82810.82330.6514
KNN0.82830.74480.91170.6659KNN0.82380.84620.80140.6483
AthMethPre0.88970.779310.799AthMethPre0.850.850.850.7
Our features0.89240.7890.99590.8022Our features0.81050.80670.81430.6210

Comparison with other feature representation algorithms.

Comparison With State-of-the-Art Predictors

To assess the effectiveness of our predictor, we compared it with existing predictors including pRNAm-PC (), MehtyRNA (), and RFAthM6A (), respectively. There were chosen since they were reported to have the best performance on the four benchmark datasets used in this work. The results were presented in Table 5.

Table 5

Dataset-S51AccSnSpMCCDataset-H41AccSnSpMCC
pRNAm-PC0.69740.69720.69750.4000MethyRNA0.90380.81680.9911N.A.
M6AMRFS0.74250.75210.73300.4852M6AMRFS0.91020.82041.00000.8339
Dataset-M41AccSnSpMCCDataset-A101AccSnSpMCC
MethyRNA0.88390.77791.0000N.A.RFAthM6A0.85450.87380.83520.7095
M6AMRFS0.79330.82810.75840.588M6AMRFS0.81050.80670.81430.6210

Results of the proposed predictor and the state-of-the-art predictors on benchmark datasets from different species.

N.A., denotes not available.

As shown in Table 5, M6AMRFS outperforms pRNAm-PC on the Dataset-S51. The Acc, Sn, Sp, and MCC by our predictor are 0.7425, 0.7521, 0.7339, and 0.4852, respectively. The performances are higher than that of the second best pRNAm-PC on this dataset. To be specific, our overall performances are 0.0451 and 0.0852 higher in terms of Acc and MCC, respectively. As for the other datasets (Dataset-H41 and Dataset-M41), we observed similar results that our overall performance outperforms the existing predictors. Only on Dataset-A101, our predictor performs slightly worse than RFAthM6A. To be concluded, our results demonstrate that the proposed predictor is better than existing predictors or at least competitive with existing predictors on multiple benchmark datasets from different species. Importantly, our predictor exhibits robust performance for multiple species, demonstrating that our predictor is able of capturing the characteristics of m6A sites in different species. This also implies that the m6A sites from different species might share the common patterns.

Conclusion

In this study, we have developed a machine learning based predictor, namely M6AMRFS, for the identification of m6A sites in multiple species. We have conducted a series of comparative study, and our experimental results indicate that our predictor is at least competitive as compared to previously published predictors. Importantly, we found that our predictor is able to achieve robust performance in several species. To the best of our knowledge, it is the first predictor that can provide predictions in multiple species. For further analysis, we found that the robust performance contributes to the following two possible reasons. One reason is the XGBoost classifier we used for model training. We have compared XGBoost with other machine learning algorithms. XGBoost is shown to perform better than other classification algorithms. The other reason is that our feature selection strategy helps to adaptively select the optimal features for specific species. We anticipate that the tool and webserver we have established will be useful for facilitating to reveal the functional mechanisms of m6A sites.

Statements

Author contributions

XQ and HC wrote the manuscript. HC developed the webserver and analyzed the results. XY analyzed the results. RS and LW designed the experiments. All authors read and approved the manuscript.

Funding

The work was supported by the National Natural Science Foundation of China (Nos. 61701340 and 61702361).

Conflict of interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

References

Summary

Keywords

N6-methyladenosine site, eXtreme Gradient Boosting, machine learning, feature representation, RNA methylation, feature selection

Citation

Qiang X, Chen H, Ye X, Su R and Wei L (2018) M6AMRFS: Robust Prediction of N6-Methyladenosine Sites With Sequence-Based Features in Multiple Species. Front. Genet. 9:495. doi: 10.3389/fgene.2018.00495

Received

18 July 2018

Accepted

04 October 2018

Published

25 October 2018

Volume

9 - 2018

Edited by

Arun Kumar Sangaiah, VIT University, India

Reviewed by

Chao Pang, Columbia University Medical Center, United States; Jianghan Qu, University of Southern California, United States

Updates

Copyright

*Correspondence: Ran Su, Leyi Wei,

This article was submitted to Bioinformatics and Computational Biology, a section of the journal Frontiers in Genetics

Disclaimer

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.

Outline

Figures

Cite article

Copy to clipboard


Export citation file


Share article

Article metrics