key: cord-0026568-qrpwxdff authors: Zhai, Yixiao; Zhang, Jingyu; Zhang, Tianjiao; Gong, Yue; Zhang, Zixiao; Zhang, Dandan; Zhao, Yuming title: AOPM: Application of Antioxidant Protein Classification Model in Predicting the Composition of Antioxidant Drugs date: 2022-01-18 journal: Front Pharmacol DOI: 10.3389/fphar.2021.818115 sha: 2d0dd750889619cf55617cf1ba21af7eaa3ed787 doc_id: 26568 cord_uid: qrpwxdff Antioxidant proteins can not only balance the oxidative stress in the body, but are also an important component of antioxidant drugs. Accurate identification of antioxidant proteins is essential to help humans fight diseases and develop new drugs. In this paper, we developed a friendly method AOPM to identify antioxidant proteins. 188D and the Composition of k-spaced Amino Acid Pairs were adopted as the feature extraction method. In addition, the Max-Relevance-Max-Distance algorithm (MRMD) and random forest were the feature selection and classifier, respectively. We used 5-folds cross-validation and independent test dataset to evaluate our model. On the test dataset, AOPM presented a higher performance compared with the state-of-the-art methods. The sensitivity, specificity, accuracy, Matthew’s Correlation Coefficient and an Area Under the Curve reached 87.3, 94.2, 92.0%, 0.815 and 0.972, respectively. In addition, AOPM still has excellent performance in predicting the catalytic enzymes of antioxidant drugs. This work proved the feasibility of virtual drug screening based on sequence information and provided new ideas and solutions for drug development. In the process of biological metabolism, reactive oxygen species (ROS) are produced. The antioxidant system in the organism can eliminate ROS, but there is a limit. Too high concentrations of ROS are not eliminated in time and will cause oxidative stress (OS) (Birben et al., 2012; Yang et al., 2020; Zhao S et al., 2021) . According to research, OS response plays an important role in the pathogenesis of many diseases. Long-term response to OS will destroy the structure of macromolecules and even affect the senescence and death of cells. Research by Azhwar Raghunath's team (Raghunath et al., 2018) has shown that the protective effect against oxidative stress is a cis-acting element of antioxidant proteins in the regulation of Nrf2 target genes, which plays a key role in redox homeostasis. Therefore, antioxidant proteins have been used in the development and screening of antioxidant drugs, which can treat cancer, neurodegenerative diseases, cardiovascular, metabolic and other diseases with oxidative stress (Liguori et al., 2018; Eleutherio et al., 2021; Zia et al., 2021) . Traditional antioxidant drug screening and discovery are carried out through biochemical experiments, which not only has a long time period and high cost, but also has the risk of failure in experiments (Lv et al., 2020a; Cheng et al., 2020; Lv Z et al., 2021; Dong et al., 2021; Goto et al., 2021; Zeng et al., 2022) . With the continuous improvement of computer technology and genome databases, methods such as data mining and machine learning are more and more widely used in biological information, drug screening and other fields (Cheng et al., 2018; Wang et al., 2018; Ding et al., 2019; Wang et al., 2019; Zeng et al., 2020a; Zhang CH et al., 2020; Zhang J et al., 2020; Lyu et al., 2020; Niu et al., 2021) . In recent years, many researchers have been exploring machine learning models suitable for identifying antioxidant proteins. The Feng team adopted the Naive Bayesian method and the AodPred model to identify antioxidant proteins, which proposed in 2013 (Feng et al., 2013) and 2016 (Feng et al., 2016) respectively. AodPred is based on a vector machine model with 3 spaced residual pairs, which is significantly better than Naive Bayes but its ability to identify antioxidant proteins is still limited. In 2016, the integration method used by Zhang showed that the secondary structure of proteins helps distinguish antioxidant proteins from non-antioxidant proteins, but the method of feature extraction for this model is complicated and time-consuming. Subsequently, both Xu et al. (2018) , Meng et al. (2019) adopted the support vector machine model to identify the target protein. In 2020 (Zhai et al., 2020) , our team explored the random forest combined with SMOTE to identify antioxidant proteins. The ability to identify antioxidant proteins has improved a lot compared to the original Feng. However, when dividing the training set and the data set for the three of them, there are ambiguities and the test set does not reflect the original data distribution. In addition, these researchers did not consider whether the model can be applied to the screening of antioxidant drugs and other practical problems when they created the model for identifying antioxidant proteins Chen et al., 2021) . In fact, this is a very good idea, but no one has done so yet. In response to these problems, we exploited a method, AOPM, which is a pipeline for identifying antioxidant protein sequence data. This model can also be used in the application of virtual antioxidant drug screening. To facilitate understanding, Figure 1 shows the flow chart of AOPM. The feature extraction part adopted amino acid composition and physical and chemical properties to extract 188-dimensional features (Liu T et al., 2020) from protein sequences, which was same with Xu. The Composition of k-spaced Amino Acid Pairs (CKSAAP) (Usman and Lee, 2019) was also adopted as the feature extraction methods. In addition, we preferred a very mature feature selection method, the Max-Relevance-Max-Distance algorithm (MRMD) (Zou et al., 2016; Lv et al., 2020b) , which was based on the Pearson correlation coefficient and could be exploited to single out the best feature subset for reducing the computational complexity and noise. On the contrary, we chose a 5-fold crossvalidation as the model selection method and random forest (Liaw and Wiener, 2002; Lv et al., 2019) as the classifier, which has the characteristics of a fast running speed and less overfitting, rather than the very popular support vector machine. Finally, on the antioxidant protein test dataset, after AOPM processing. The sensitivity (SN), specificity (SP), accuracy (ACC), Matthew's Correlation Coefficient (MCC) and an Area Under the Curve (AUC) reached 87.3, 94.2, 92.0%, 0.815 and 0.972, respectively, which were significantly better than the results with the AodPred and Zhai. In addition, AOPM still has excellent performance in identifying the proteins that make up antioxidant drugs, providing new ideas for exploring the research of drug components. In addition, when using AOPM to predict the 36 protein sequences located in the DrugBank (Wishart et al., Frontiers in Pharmacology | www.frontiersin.org January 2022 | Volume 12 | Article 818115 2 2018) data set, 11 of them were judged to have the function of antioxidants. Among them, Superoxide dismutase [Cu-Zn] is indeed a protein with antioxidant capacity (Dzięgielewska-Gęsiak et al., 2014; Tiwari et al., 2019; Ściskalska et al., 2020) . This work proved the feasibility of virtual drug screening based on sequence information and provided new ideas and solutions for drug development Jakhar et al., 2020; Shaker et al., 2021; Yan et al., 2021; Zhu et al., 2021) . We first collected proteins with antioxidant activities from the antioxidant protein database (AOD) (Feng et al., 2017) . AOD (Antioxidant Protein Database) is a manually planned and experimentally verified antioxidant protein database. The data and information are extracted from UniProtKB/ Swiss-Prot (release 2016_11) according to the following steps: 1) only proteins with experimentally proven antioxidant activities were selected; and 2) ambiguous proteins were excluded, such as those containing nonstandard letters like "B," "X," and "Z". After this rigorous screening, we obtained 710 protein sequences as the original positive samples for the experiment. The negative samples were 1552 PDB proteins with identical values <20%, which were picked by PISCESculled. Then we divided the original data set into training set and test set according to the ratio of 4:1. The training set contains 568 antioxidant proteins and 1242 non-antioxidant proteins. The rest of the data are the test set, including 142 antioxidant proteins and 310 non-antioxidant proteins. The detailed data set information is shown in Table 1 . In addition, in the DrugBank database, 19 drugs were found to have antioxidant properties. On this basis, we screened out 36 protein sequences of enzymes that play a catalytic role in antioxidant drugs. This data set was used to test the prediction performance of AOPM in the real data set. The UniProt IDs of 36 protein sequences were shown in Table 2 . In addition, a protein can act as a catalytic enzyme in different antioxidants, as shown in Figure 2 . The number of antioxidant proteins is relatively small. Although the ratio of the number of antioxidant proteins to the number of non-antioxidant proteins in the training set is 1:2, in order to find the characteristics of more clearly distinguishing antioxidant proteins, we performed the training dataset under sampling process. In this study, we selected five different under sampling methods in KEEL (Triguero et al., 2017) to resemble the sample. These five methods included CNN_TomekLinks, CPM, NCL, OSS, and RandomUnderSample. In the processed data set, the number of antioxidant proteins and non-antioxidant proteins are not exactly the same. The operation of this step is to highlight the characteristics that are beneficial to distinguish antioxidant proteins as much as possible. In order to obtain sequence information more comprehensive, we adopted feature extraction methods from two perspectives, including sequence composition and the physical and chesmical properties of amino acids (Zulfiqar et al., 2021a; Cheng L et al., 2021; Zhang et al., 2021) . Among them, we used the 188D method to extract the characteristic information about the physical and chemical properties of the sequence, and select the Composition of k-spaced Amino Acid Pairs (CKSAAP) (Chen et al., 2007) method to obtain the characteristic information about the sequence composition (Naseer et al., 2020; Long et al., 2020) . The expression form of the amino acid sequence is a string sequence or a discrete multidimensional vector. The multidimensional vector representation method lacks the content of amino acid position information and arrangement sequence; therefore, the research value is small. The descriptive form of the string sequence is that each of the 20 amino acids is represented by a letter, and the letter sequence is used to represent a protein sequence. Since the classifier cannot recognize the string, the feature extraction function of this project uses the 188D feature extraction method to extract useful numerical information from the amino acid sequence as the input of the model. The 188D feature extraction method is based on 188 features extracted based on protein sequence information and physical and chemical properties. In 2003, the researchers proposed this feature extraction method, which combines the physical and chemical properties of proteins. The 188-dimensional features can be divided into two categories: one is composed of 20 amino acids, and the other is physical and chemical properties, including hydrophobicity, polarity, normalized van der Waals volume, surface tension, charge, polarizability, solvent FIGURE 2 | The number of catalytic enzymes contained in different antioxidants. The catalytic enzymes of antioxidant drugs are diverse. For example, for antioxidant drugs such as Vitamin E and Carvedilol, the number of enzymes that can catalyze is as high as 9 types. Of course, some antioxidant drugs can only be catalyzed by a specific enzyme, Such as Anisodamine, Silibinin, and Lipoic acid. Frontiers in Pharmacology | www.frontiersin.org January 2022 | Volume 12 | Article 818115 accessibility, and secondary structure. The dimensions of the different characteristics are shown in Table 3 . First, we calculated the corresponding frequencies of the 20 amino acids, which can be expressed as n 1, n 2, n 3, /n 20 , where L is the length of the sequence and F ai is the frequency of the i-th amino acid. The frequency formula for the appearance of 20dimensional amino acids is as follows. The 20 amino acids are divided into three types according to their physical and chemical properties. These three categories include content (C), distribution (D) and bivalent frequency (B), which are adopted to describe the physical and chemical properties of proteins. Table 4 shows the amino acid grouping table of the 8 physicochemical properties. First, we calculated the frequency characteristics of the three categories, which are represented as CS 1 , CS 2 , and CS 3 . Their frequency characteristics are expressed as: For each group, the first and 25, 50, 75 and 100% dipeptide chain positions are represented by DS ij , where i is the group number, and the value range is 1-3; j is the dipeptide chain position, and the value range is 1-5. In addition, we also calculated the number of dipeptides from different groups and obtained the parameters BS 1 , BS 2 , and BS 3 so that the frequency of the doublet sequence is calculated as: In the above formula, F qi represents the i-th feature of a physical and chemical property. A total of (3 + 3 + 3 × 5) 21 feature vectors are extracted from each attribute, and finally, all 21 × 8 168 feature vectors are extracted from 8 physical and chemical properties. In addition, the 20 amino acid frequencies are added, and finally, 168 + 20 188 dimensional feature vectors are obtained. The Composition of k-spaced Amino Acid Pairs (CKSAAP) feature delegates the component of amino acids. It represents the frequency calculation of two amino acids separated by k residues. Experiments have confirmed that the three-spaced residue pair feature is beneficial to the classification of antioxidant proteins, so we only adopted k 3 in this method, which selected 400 dimensions. 20 kinds of amino acids were brightly combined in pairs to obtain 400 amino acid pairs. We can calculate the frequency of 400 amino acid pairs in a protein sequence. Then, a 3-spaced feature vector can be defined as:where n ij is the number of times the ij-th amino acid pair appears in a protein sequence and N is the length of the protein sequence. In addition, ij is the amino acid pair of 20 kinds of amino acids in two groups. Feature selection obtains the most effective feature subset for classification and recognition of the many features (Wang et al., 2010; Mo et al., 2020; Sheng et al., 2021; . That is, it captures a set of "small but precise" classification features with a small probability of error. While reducing the dimensionality of the feature space in this way, it also speeds up the construction of the classifier model (Yu XP et al., 2021; Long et al., 2021; Yang et al., 2021) . In AOPM, the Max-Relevance-Max-Distance algorithm (MRMD) was used for feature selection, which was proposed by Zou. The MRMD score of each feature consists of two parts: the correlation and distance value between the feature and other features. The Pearson correlation coefficient was used to calculate the correlation between features. It represents the degree of linear correlation between features. The larger the absolute value is, the stronger the degree of linear correlation. The value of MR i (maxrelevance) for feature i is defined as follows: where F i → is the i-th feature of each instance and C i → is the i-th target class of each instance. The distance value provides four calculation methods. In addition to the three mature distance calculation methods, there is another method that is, based on the average of the three methods to obtain the distance value. The three traditional methods are Euclidean distance, cosine similarity and Tanimoto coefficient, which are designated by the symbols ED i , COS i , and TC i . The mean of these is designated by the symbol MEAN i . Finally, the value of MD i (max-distance) for feature i is defined as follows: According to MR i and MD i , the MRMD score is defined as: All features are arranged in descending order according to the MRMD score. One feature with the highest MRMD score is sequentially added to the feature subset. Then, the feature subset is input into the selected classifier for classification, and the classification accuracies of different feature subsets are recorded. In the end, the feature subset with the highest accuracy and the least number of features is the result of feature selection. Random forest is an ensemble algorithm that integrates multiple trees through the idea of ensemble learning. It has been widely used in bioinformatics Manavalan et al., 2019a; Manavalan et al., 2019b; Riaz and Li, 2019; Su et al., 2019; Ściskalska et al., 2020; Zeng et al., 2020b; Ao et al., 2021; Zulfiqar et al., 2021b) . It consists of N decision trees. After the sample is input into the random forest, each decision tree will get a classification result, and then N trees will get N classification results. Count the voting results of all classification results, and the category with the most votes is the final output. In our research, we use the random forest as the classifier because it has several advantages that suit our data. The dimensionality of the extracted feature set is high, even after dimensionality reduction, it still belongs to high-dimensional data. Random forest is less affected by parameters, and when processing high-dimensional data, the accuracy is not affected. In addition, using random forest processing, the running speed is fast, there is no need to debug many parameters like SVM, and the time cost is low. At present, AOPM can only deal with two classification problems. There are three commonly used evaluation methods, including the independent data set sampling test, the k-fold cross validation and the jack-knife test (Wang et al., 2008; Wei et al., 2014; Wei et al., 2017; Basith et al., 2018; Wei et al., 2018; Lv H et al., 2021; Wu and Yu, 2021) . To simplify the calculation, we adopted 5-fold cross-validation to compare the classifiers. And test the robustness of the model on the test dataset. In addition to the commonly used evaluation indicators sensitivity (SN), specificity (SP) and accuracy (ACC), AOPM also provided a Matthew's Correlation Coefficient (MCC) and an Area Under the Curve (AUC) to evaluate the performance of the ensemble classifier, and the formulas were defined as follows (Liang et al., 2019; Lv et al., 2020c) : where TP is the number of samples judged as positive for the positive class, FP is the number of samples judged as positive for the negative class, FN is the number of samples judged as negative for the positive class, and TN is the number of samples judged as negative for the negative class. MCC is an index used in machine learning to measure the classification performance of two categories. In addition, the AUC value was obtained by calculating the area of the ROC curve and the area surrounded by the X-and Y-axes, where the X-and Y-axes of the ROC curve were (1-SP) and SN, respectively. According to existing research, a series of feature extraction methods have been proved to be effective for the classification of antioxidant proteins, such as g-gap dipeptide feature, CTD, 188D, etc. However, the existing methods all use a certain method alone, and do not use them in combination. Therefore, in the planning stage of the experiment, we chose CKSAAP and 188D to That was much higher than that of AodPred and Zhai, whose SN was higher than 0.99 and 0.204, respectively. Frontiers in Pharmacology | www.frontiersin.org January 2022 | Volume 12 | Article 818115 find the most suitable combination of features for the target protein. Among them, CKSAAP is divided into pairs containing g-spacer residues (g 0, 1, 2, 3, 4, 5). The experimental results of the random forest classifier and 5-fold cross-validation on the training set were shown in Table 5 . Only 188D is selected as the feature extraction method, and the SN value reaches 0.877, which was the highest value of all the combination methods, but other indicators are not ideal. When g 3 for CKSAAP and 188D, all the values except SN are excellent. The SP, ACC, MCC, and AUC were 0.960, 0.898, 0.802, and 0.964, respectively. In order to compare the most suitable under-sampling methods for the antioxidant protein data set, we chose four undersampling methods, including CNN_TomekLinks, CPM, OSS, and RandomUnderSample, to process the training data separately. At the same time, we followed the single-variable principle. All the parameters in the feature extraction and feature selection of the five sets of data were exactly the same. Finally, 5fold cross-validation was adopted to obtain the classification effect of the model in the random forest classifier. The classification effect of 5 sets of data is shown in Table 6 . After the random under-sampling method was used, the MCC and AUC of the model reach 0.802 and 0.964, which were higher than those obtained by other under-sampling methods and direct classification. In addition, SP and ACC have the highest value among all under sampling methods. In order to find the most suitable classifier, we selected 8 traditional machine learning classifiers for comparison: BayesNet, naive Bayes, logistic function, AdaBoostM1, bagging, random forest, decision table, and J48. In addition, the results obtained after random under sampling and MRMD processing of the training data set was measured by 5-fold cross-validation in different classifiers. Figure 3 shows the classification results of the training dataset on different classifiers. Compared with most basic classifiers, random forest showed an exciting classification effect, all indicators were very competitive in all classifiers. It was obviously that the SP, ACC, MCC, and AUC of random forest were much higher than other traditional classifiers, which were 0.960, 0.898, 0.802, and 0.964, respectively. Compared with the Bagging classifier with the highest SN value, the SN value reaches 0.836, which was nearly lower than the highest value of 0.027. In order to verify the robustness of AOPM, we chose to compare with two existing methods. They are the AodPred developed by the Feng team and the random forest model developed by ourselves in 2020. Because our data set is different from the existing method, we retrained the model according to the corresponding method and applied it on the same test dataset to get the following results. Figure 4 shows the classification results of the test dataset on the state-of-theart methods. It was obviously that the SN, ACC, and AUC of AOPM were much higher than that of AodPred and Zhai, whose SN was higher than 0.99 and 0.204, respectively, indicating that AOPM was more sensitive to the classification of target proteins, which was also consistent with our goal. Although the SP value was slightly lower than the two first, MCC value was higher than Zhai and tinier lower than AodPred, this did not prevent AOPM from being a model with excellent classification effects. In DrugBank, the 36 protein sequences we screened were subjected to the same feature extraction and screening operations, and then they were input into AOPM to get their prediction results. Among them, 11 proteins were predicted to be antioxidant proteins, and the predicted value of protein P00441 reached 0.99, and the predicted value of protein P48506 reached 0.79. The predicted results are shown in Figure 5 . After consulting related literature, protein P00441 and protein P48506 were Superoxide dismutase [Cu-Zn] and Glutamate--cysteine ligase catalytic subunit, respectively. Although they play a catalytic role in antioxidants, they are also a strong antioxidant protein in themselves. We have consulted many literatures about Superoxide dismutase [Cu-Zn] . Superoxide dismutase [Cu-Zn] is the catalytic enzyme of many antioxidant drugs, and it has antioxidant properties. Although the current research does not clearly show that the remaining proteins can play an antioxidant effect, the sequence analysis can guide scientists to try their biological and chemical experiments. In this paper, we proposed a tool named AOPM to identify antioxidant proteins. 188D and the Composition of k-spaced Amino Acid Pairs were adopted to extract the feature set, and we selected the optional feature set with MRMD. Using the 5-fold cross-validation and random forest on the test dataset, we obtained an average accuracy of 0.920. The sensitivity, specificity, the Matthew's Correlation Coefficient and an Area Under the Curve were 0.873, 0.942, 0.815, and 0.972, respectively. Compared with previous methods, we re-collect the antioxidant protein data. After such processing, while the proportion of positive and negative examples of the data set is reduced, the characteristics of antioxidant proteins are also strengthened, and the robustness of the trained model were greatly improved compared with existing methods. In addition, AOPM also made predictions on the real data set of DrugBank, and indeed found proteins with antioxidant properties. This work proved the feasibility of virtual drug screening based on sequence information and provided new ideas and solutions for drug development. The original contributions presented in the study are included in the article/Supplementary Material, further inquiries can be directed to the corresponding authors. RFhy-m2G: Identification of RNA N2-Methylguanosine Modification Sites Based on Random forest and Hybrid Features iGHBP: Computational Identification of Growth Hormone Binding Proteins from Sequences Using Extremely Randomised Tree Prediction of Protein Crystallization Using Collocation of Amino Acid Pairs MUFFIN: Multi-Scale Feature Fusion for Drug-Drug Interaction Prediction DincRNA: a Comprehensive Web-Based Bioinformatics Toolkit for Exploring Disease Associations and ncRNA Function gutMDisorder: a Comprehensive Database for Dysbiosis of the Gut Microbiota in Disorders and Interventions Frontiers in Pharmacology | www.frontiersin.org gutMGene: a Comprehensive Database for Target Genes of Gut Microbes and Microbial Metabolites Molecular Design in Drug Discovery: a Comprehensive Review of Deep Generative Models Protein Crystallization Identification via Fuzzy Model on Linear Neighborhood Representation Deep Learning in Retrosynthesis Planning: Datasets, Models and Tools. Brief. Bioinform., bbab391 Zn-Superoxide Dismutase Activity as Biomarkers of Oxidative Stress in Elderly Prediabetics SOD1, More Than Just an Antioxidant Identification of Antioxidants from Sequence Information Using Naive Bayes Identifying Antioxidant Proteins by Using Optimal Dipeptide Compositions AOD: the Antioxidant Protein Database Tropomyosin-related Kinase B (TrkB) Full-Length Isoform Is Related to Advanced-Stage clear Cell Ovarian Cancer (CCOC) Relevance of Molecular Docking Studies in Drug Designing DUNet: A Deformable Network for Retinal Vessel Segmentation. Knowledge-Based Syst Classification and Regression by randomForest Oxidative Stress, Aging, and Diseases Identification of Novel Key Targets and Candidate Drugs in Oral Squamous Cell Carcinoma ApoPred: Identification of Apolipoproteins and Their Subfamilies with Multifarious Features Predicting Protein Phosphorylation Sites Based on Deep Learning Integrated Biomarker Profiling of the Metabolome Associated with Impaired Fasting Glucose and Type 2 Diabetes Mellitus in Large-Scale Chinese Patients A Random Forest Sub-golgi Protein Classifier Optimized via Dipeptide and Amino Acid Composition Features Identification of Sub-golgi Protein Localization by Use of Deep Representation Learning Features RF-PseU: A Random Forest Predictor for RNA Pseudouridine Sites Escherichia Coli DNA N-4-Methycytosine Site Prediction Accuracy Improved by Light Gradient Boosting Machine Feature Selection Technology Anticancer Peptides Prediction with Deep Representation Learning Features DeepIPs: Comprehensive Assessment and Computational Identification of Phosphorylation Sites of SARS-CoV-2 Infection Using a Deep Learning-Based Approach iPro2L-PSTKNC: a Two-Layer Predictor for Discovering Various Types of Promoters by Position Specific of Nucleotide Composition Meta-4mCpred: A Sequence-Based Meta-Predictor for Accurate DNA 4mC Site Prediction Using Effective Feature Representation mAHTPred: a Sequence-Based Meta-Predictor for Improving the Prediction of Antihypertensive Peptides Using Effective Feature Representation AOPs-SVM: a Sequence-Based Classifier of Antioxidant Proteins Using a Support Vector Machine Integrated Analysis of mRNA-Seq and miRNA-Seq to Identify C-MYC, YAP1 and miR-3960 as Major Players in the Anticancer Effects of Caffeic Acid Phenethyl Ester in Human Small Cell Lung Cancer Cell Line Sequence-based Identification of Arginine Amidation Sites in Proteins Using Deep Representations of Proteins and PseAAC iEnhancer-EBLSTM: Identifying Enhancers and Strengths by Ensembles of Bidirectional Long Short-Term Memory Antioxidant Response Elements: Discovery, Classes, Regulation and Potential Applications Non-coding RNA Associated Competitive Endogenous RNA Regulatory Network: Novel Therapeutic Approach in Liver Fibrosis Changes in the Activity and Concentration of Superoxide Dismutase Isoenzymes (Cu/Zn SOD, MnSOD) in the Blood of Healthy Subjects and Patients with Acute Pancreatitis Introduction of Advanced Methods for Structure-Based Drug Discovery CNA2Subpathway: Identification of Dysregulated Subpathway Driven by Copy Number Alterations in Cancer Deep-Resp-Forest: A Deep forest Model to Predict Anti-cancer Drug Response Copper Ion / H2O2 Oxidation of Cu/Zn-Superoxide Dismutase: Implications for Enzymatic Activity and Antioxidant Action Frontiers in Pharmacology | www.frontiersin.org KEEL 3.0: an Open Source Software for Multi-Stage Analysis in Data Mining Afp-cksaap: Prediction of Antifreeze Proteins Using Composition of K-Spaced Amino Acid Pairs with Deep Neural Network Transcription Factor and microRNA Regulation in Androgen-dependent and -independent Prostate Cancer Cells Signal Transducers and Activators of Transcription-1 (STAT1) Regulates microRNA Transcription in Interferon Gamma-Stimulated HeLa Cells MeDReaders: a Database for Transcription Factors that Bind to Methylated DNA CrystalM: a Multi-View Fusion Approach for Protein Crystallization Prediction Predicting Thermophilic Proteins by Machine Learning Improved and Promising Identification of Human MicroRNAs by Incorporating a High-Quality Negative Set Improved Prediction of Protein-Protein Interactions Using Novel Negative Samples, Features, and an Ensemble Classifier ACPred-FL: a Sequence-Based Predictor Using Effective Feature Representation to Improve the Prediction of Anti-cancer Peptides DrugBank 5.0: a Major Update to the DrugBank Database EPSOL: Sequence-Based Protein Solubility Prediction Using Multidimensional Embedding Clinicopathological Features and Prognostic Factors for Survival and Lymph Node Metastases in Stage IB Adenocarcinoma of the Cervix SeqSVM: a Sequence-Based Support Vector Machine Method for Identifying Antioxidant Proteins Editorial: Feature Representation and Learning Methods with Applications in Protein Secondary Structure Recent Advances on the Machine Learning Methods in Identifying Phage Virion Proteins Risk Prediction of Diabetes: Big Data Mining with Fusion of Multifarious Physical Examination Indicators Breast Cancer Overall-Survival Can Be Predicted with a 19 lncRNA Tissue Signature A Network Embedding Framework Based on Integrating Multiplex Network for Drug Combination Prediction Repurpose Open Data to Discover Therapeutics for COVID-19 Using Deep Learning Network-based Prediction of Drug-Target Interactions Using an Arbitrary-Order Proximity Embedded Deep forest Toward Better Drug Discovery with Knowledge Graph Identifying Antioxidant Proteins by Using Amino Acid Composition and Protein-Protein Interactions Systemic Therapy for Hepatocellular Carcinoma: Advances and Hopes AIEpred: an Ensemble Predictive Model of Classifier Chain to Identify Anti-inflammatory Peptides iBLP: An XGBoost-Based Predictor for Identifying Bioluminescent Proteins Bioluminescent Proteins Prediction with Voting Strategy Identifying Plant Pentatricopeptide Repeat Proteins Using a Variable Selection Method. Front Prediction of Microbe-Drug Associations Based on Chemical Structures and the KATZ Measure The Role of Curcumin in Aging and Senescence: Molecular Mechanisms A Novel Features Ranking Metric with Application to Scalable Visual and Bioinformatics Data Classification Identification of Cyclin Protein Using Gradient Boost Decision Tree Algorithm Computational Identification of N4-Methylcytosine Sites in the Mouse Genome with Machine-Learning Method YuZ conceived and designed the project. YiZ, YG, and ZZ conducted experiments and analyzed the data. YiZ and JZ wrote the paper. TZ, DZ, and YuZ revised the manuscript. All authors read and approved the final manuscript. 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.