Prediction of Protein–Protein Interactions in Arabidopsis, Maize, and Rice by Combining Deep Neural Network With Discrete Hilbert Transform

Protein–protein interactions (PPIs) in plants play an essential role in the regulation of biological processes. However, traditional experimental methods are expensive, time-consuming, and need sophisticated technical equipment. These drawbacks motivated the development of novel computational approaches to predict PPIs in plants. In this article, a new deep learning framework, which combined the discrete Hilbert transform (DHT) with deep neural networks (DNN), was presented to predict PPIs in plants. To be more specific, plant protein sequences were first transformed as a position-specific scoring matrix (PSSM). Then, DHT was employed to capture features from the PSSM. To improve the prediction accuracy, we used the singular value decomposition algorithm to decrease noise and reduce the dimensions of the feature descriptors. Finally, these feature vectors were fed into DNN for training and predicting. When performing our method on three plant PPI datasets Arabidopsis thaliana, maize, and rice, we achieved good predictive performance with average area under receiver operating characteristic curve values of 0.8369, 0.9466, and 0.9440, respectively. To fully verify the predictive ability of our method, we compared it with different feature descriptors and machine learning classifiers. Moreover, to further demonstrate the generality of our approach, we also test it on the yeast and human PPI dataset. Experimental results anticipated that our method is an efficient and promising computational model for predicting potential plant–protein interacted pairs.

Introduction

Identification of protein–protein interactions (PPIs) in plants is essential for exploring the mechanisms underlying of biological processes, such as organ formation, homeostasis control (Canovas et al., 2004), plant defense (Zhang et al., 2010), signal transduction (Khan and Kihara, 2016), and stress response (Bracha-Drori et al., 2004). Although numerous high-throughput techniques have been developed to identify PPIs of model species, such as affinity purification mass spectrometry (Fukao, 2012; Armean et al., 2013) and yeast two-hybrid (Causier and Davies, 2002; Fang et al., 2002), these approaches are cumbersome, costly, particularly time consuming, and always suffer from high false positive rate. To overcome these problems, there is an urgent need to develop sequence-based computational methods that can accurately predict potential PPIs while analyzing the functions of plant genes.

In recent years, many studies have been introduced for detecting PPIs. These methods can be broadly classified into several categories: protein structure–based method (Hayashi et al., 2018), genomic information–based method (Zahiri et al., 2014), evolutionary relationship–based approach (Xu et al., 2011), and protein sequence–based method (Richoux et al., 2019). In fact, the first three methods have better prediction performance. However, these methods typically require the structural details of proteins such as 3D structural and protein homology information. If this prior knowledge is not available, then the method will not perform as expected. Theoretically, amino acid sequence contains all the necessary information to detect PPIs. In addition, with the improvement of sequencing technology, more and more plant genome sequences are available. Hence, it is meaningful to develop computational methods to predict potential PPIs from sequence information.

To date, some new approaches have been proposed to predict PPIs using the feature descriptors of protein sequence, such as the composition-transition-distribution descriptor (Yang et al., 2010), auto-covariance descriptor (Guo et al., 2008), Zernike moments descriptor (Wang et al., 2017), and local descriptor (Davies et al., 2008). These descriptors summarize specific aspects of amino acid sequence, including frequencies of local patterns, physicochemical properties, and positional distribution of protein sequence. However, the coverage of these feature descriptors is still limited. Recently, many deep learning techniques also have been applied on PPI-based prediction. For example, Du et al. (2017) presented an approach called DeepPPI, which adopted deep neural networks (DNN) to extract high-level features from raw input features of protein sequence to identify PPIs. Zeng et al. (2020) were inspired by the deep learning algorithm and proposed a framework called DeepPPISP, which extracts local and global features from amino acid sequences and employs DNN to predict PPIs. Sun et al. (2017) employed stacked autoencoder (SAE), which is a deep learning algorithm to predict PPIs from human protein sequence. Hashemifar et al. (2018) developed a novel sequence-based approach called DPPI that used Siamese-like convolutional neural networks (CNN) combined with data augmentation and random projection to improve PPI prediction. Sledzieski et al. (2021) proposed a novel model named D-SCRIPT, which indicated that employing a deep learning language modeling of protein sequence data is effective for PPI prediction. Chen et al. (2019) put forward an end-to-end framework that combined contextualized information and local features with a deep residual recurrent CNN in the Siamese architecture to predict PPIs only using protein sequence information. Yi et al. (2018) proposed the RPI-SAN model using a deep learning stacked autoencoder network to extract features from RNA and amino acid sequences. Finally, they fed these features to the RF model for training and predicting. Despite these advances in previous studies, there is still a need to improve the accuracy and efficiency of the PPI prediction models.

In this article, we combined DNN with discrete Hilbert transform (DHT) and singular value decomposition (SVD) to predict PPIs in plants. More specifically, for each plant primary sequence, position-specific score matrix (PSSM) was constructed, and then DHT was applied to gather important information from the protein PSSM. Subsequently, SVD algorithm was adopted to reduce feature dimension and noise interference and finally generated a 600-dimensional feature vector. Lastly, a deep neural network was applied to make predictions between target plant proteins. When the proposed method was applied on the Arabidopsis thaliana, maize (Zea mays), and rice (Oryza sativa) PPI datasets, it yielded promising results of average AUC (area under ROC curve) values of 0.8369, 0.9466, and 0.9440. When compared with some different feature selection methods and state-of-the-art machine learning classifiers, our method obtained better results. In addition, to achieve more convincing evidence, we also applied our method to the yeast and human PPI dataset. These combined results suggest that the proposed approach is effective and trustworthy for predicting potential PPIs in plants.

Materials and Methods

Data Collection and Construction of the Benchmarking Set

To validate the robustness and effectiveness of the proposed model, we performed it on three plant PPI datasets, A. thaliana, Z. mays, and O. sativa. The A. thaliana dataset was collected from TAIR¹ (Rhee et al., 2003), IntAct² (Kerrien et al., 2012), and BioGRID³ (Stark et al., 2006). After removing the redundancy, the final A. thaliana–positive dataset comprised 28,110 PPI pairs containing 7,437 A. thaliana proteins. These protein-interacted pairs constructed the primary A. thaliana PPI network. For the construction of the negative dataset, we employed a bipartite to formulate a network of plant PPIs, where the nodes represent the plant proteins and the links denote the interactions between them. Here, we use A. thaliana as an example. The whole associations between the 7,437 proteins are 55,308,969 (7,437 × 7,437) in the corresponding bipartite. However, only 28,110 PPIs had been demonstrated to have the interactions. Thus, the possible number of negative pairs is 55,280,859 (55,308,969–28,110), which is significantly more than the positive samples. To handle this binary classification problem, we randomly collected 28,110 non-interacting pairs as the negative dataset. In theoretical terms, the negative samples may contain a small number of positive samples; however, given the size of the whole non-interaction pairs, the probability of this situation is very small. In this way, the whole A. thaliana dataset consists of 56,220 protein pairs.

Maize and rice are the main cash crops in the world. The maize (Z. mays) dataset contains 14,800 positive pairs, which was downloaded from PPIM⁴ (Zhu et al., 2016) and agriGO⁵ (Tian et al., 2017). Similarly, we assumed that the proteins in different subcellular work compartments have no interactions and finally achieved 14,800 non-interacting protein pairs. The rice (O. sativa) dataset consisted of 9,600 protein pairs, 4,800 positive pairs, and 4,800 negative pairs collected from the PRIN database⁶ (Gu et al., 2011).

Representation of the Plant Amino Acid Sequence

To mine highly efficient features for training the models, each protein pair is encoded as 800-dimensional feature vector by PSSM (Gribskov et al., 1987). PSSM has been successfully employed in various fields of biological research including the prediction of PPI site, subcellular localization, and DNA-binding protein identification. In this section, we applied PSI-BLAST (Altschul and Koonin, 1998) tool to represent protein sequence as a U × 20 matrix, where Q = {η_a,b:a = 1⋯U andb = 1⋯20}, and it can obtain the information of plant sequential evolution. PSSM can be defined as

$$Q=\left[\begin{array}{c}{\eta }_{1,1},{\eta }_{1,2},\mathrm{\cdots }{\eta }_{1,20}\hfill \\ {\eta }_{2,1},{\eta }_{2,2},\mathrm{\cdots }{\eta }_{2,20}\hfill \\ \hfill \mathrm{⋮}\mathit{\hspace{1em}\hspace{1em} }\mathrm{⋮}\mathit{\hspace{1em}}\mathrm{\cdots }\mathit{\hspace{1em}}\mathrm{\cdots }\hfill \\ {\eta }_{U,1},{\eta }_{1,2},\mathrm{\cdots }{\eta }_{U,20}\hfill \end{array}\right](1)$$

where η_a,b represents probability that the a-th mutate to b-th amino acid during the evolutionary process. In the experiment, plant protein sequences were adopted as seeds to search and align homogenous sequences from SwissProt database by PSI-BLAST tool. The tool will be used to recognize members of gene family and evolutionary relationships between plant protein sequences. It is also able to generate a 20-dimensional vector to denote the probabilities of conservation against mutations to the 20 amino acids. The number of iterations is set to 3 and the E-value is cut off at 0.001 to achieve homologous sequences. The PSI-BLAST tool and SwissProt database can be accessed online⁷.

Discrete Hilbert Transform

In this section, we introduce discrete Hilbert transform (DHT; Cizek, 1970) to extract feature descriptors from the PSSM to make the prediction more convenient and accurate. DHT is used as a tool for signal analysis in the time and frequency domains. Before describing the 2-dimensional DHT, the 1-D DHT (Ponomareva et al., 2018) is used in the spatial and frequency domain and has been previously described (Stark, 1971; Bracewell and Bracewell, 1986; Zhu et al., 1990; Onodera et al., 2005).

To better extract the feature descriptors, we used the 2-D DHT for constructing the local energy of PSSM. In this work, we applied the 2-D DHT, which is defined by Read and Treitel (1973) in the frequency domain. Our Matlab code is shown as follows:

function x = hilbert2(xr,m,n)

%HILBERT2 Discrete-time 2D analytic signal via Hilbert transform.

% X = HILBERT2(Xr) computes the 2D discrete-time analytic signal

% X = Xr + i^∗Xi such that Xi is the Hilbert transform of real image Xr.

% If the input Xr is complex, then only the real part is used: Xr = real(Xr).

% HILBERT2(Xr,M,N) computes the MxN-point Hilbert transform. Xr is padded

% zeros if it has less than MxN points, and truncated if it has more.

if nargin < 2, n = []; end

if ∼isreal (xr)

   warning (’HILBERT2 ignores imaginary part of input.’)

   xr = real (xr);

end

if isempty (n)

   [m, n] = size (xr);

end

if m < 2 | | n < 2,

   x = Hilbert (xr); % 1D analytic signal

   return;

end;

In this work, PSI-BLAST encoded each protein sequence as a U×20 matrix. Due to the different lengths of protein sequences, the size of each matrix constructed by PSSM is also different. To handle this problem, we transformed the variably sized PSSM into a 20×20 matrix, and the 2-D DHT is applied to extract feature vectors from the PSSM profile. In this way, each plant protein sequence will be converted into a 400-dimensional vector by 2-D DHT. As a non-linear filtering technique, SVD has been widely applied in noise reduction of vibration signals. This is because the signals after noise reduction have a small phase-shift and there is no time delay effect. To improve the prediction accuracy and reduce the dimensionality of the input feature matrix, we applied SVD (Klema and Laub, 1980) algorithm to reduce size of feature vectors from 400 to 300. At the same time, the lower dimensions could reduce the complexity of the model and increase the generalization error of the classifier. Finally, each protein pair will be represented as a 600-dimensional DHT descriptor.

Deep Neural Networks

Considering the larger numbers of hidden layers that can be used for training networks, artificial neural networks consist of two or more hidden layers that are often referred as DNN as shown in Figure 1. The depth of a neural network relates to the quantity of hidden layers, and the largest number of neurons determines the width of DNN (Hinton et al., 2006; Hinton and Salakhutdinov, 2006).

FIGURE 1

Figure 1. The construction of deep neural networks.

In terms of structure, DNN is composed of many plain modules, which appear as a multilayer stack. The data are first received by the input layer, and then converted through a non-linear way across many hidden layers. Before calculating the final output, the average gradient is first computed and the corresponding weights are adjusted. Neurons of a hidden layer or input layer are associated with the neurons of the existing layer. Each neuron will compute a weighted sum of its input and perform a non-linear activation function to capture its outputs. The non-linear activation functions usually include sigmoid, rectified linear unit (ReLU), and hyperbolic tangent. In this work, we used the sigmoid and ReLU. We constructed a DNN-based model using the TensorFlow platform shown in Figure 1. This model consists of two hidden layers with 48 neurons each. The DHT feature descriptors are employed as the inputs for the DNN model. After that, these features were set into the hidden layers for training and predicting PPIs. Adam algorithm (Kingma and Ba, 2014), which is an adaptive learning rate approach, was adopted in our methods to accelerate the training process. At the same time, to avoid overfitting, the dropout technique was also applied to our model (Khan et al., 2019). We also used the cross-entropy loss and ReLU activation function to speed our training and achieve better predictive performance (Hinton et al., 2015). The loss can be calculated by the following formulas:

$${\mathit{R}}_{i1}^m=\mathrm{\sigma }(T_{i1}{X}_{i1}+b_{i1})(i=1,2,3,\mathrm{\cdots },n;m=1,2)(2)$$

$${\mathit{R}}_{ij}^m=\mathrm{\sigma }(T_{ij}{R}_{i\left(j-1\right)}+b_{ij})(i=1,2,3,\mathrm{\cdots },n;$$

$$j=2,3,4\mathrm{\cdots },h_1;m=1,2)(3)$$

$${\mathit{R}}_{ik}^3={\mathrm{\sigma }}_1(T_{ik}(R_{i{h}_1}^1\oplus R_{i{h}_1}^2)+b_{ik})(i=1,\mathrm{\cdots },n;k=h_1+1)(4)$$

$${\mathit{R}}_{ik}^3={\mathrm{\sigma }}_1(T{}_{ik}R_{i(k-1)}+b_{ik})(i=1,\mathrm{\cdots },n;k=h_1+2,\mathrm{\cdots },h_2)(5)$$

$$L=-\frac{1}{n}\sum _{i=1}^n[y_i\ln ({\mathrm{\sigma }}_2(T_{ih2}{R}_{ih2}+b_{ih2})$$

$$+(1-y_i)\ln (1-{\mathrm{\sigma }}_2(T_{ih2}{R}_{ih2}+b_{ih2}))](6)$$

In Eqs. 2–6, n describes the amount of protein pairs that need to be trained, m denotes the individual network, h₁ represents the depth of two individual networks, and h₂ denotes the depth of the fused network. The activation function of ReLU and output layer with sigmoid is σ₁ and σ₂, respectively; ⊕ is the concatenation operator. R represents the output of hidden layer and y is the corresponding desired output. T and b indicate the weight matrix and bias vectors.

Results

Evaluation Criteria

To prevent overfitting and validate the robustness of our method, five-fold cross-validation (CV) scheme is performed on our method. Specifically, the entire plant’s PPI dataset will be randomly split into five equal parts; four of them will be employed for training and the remaining one was used for testing. The training and testing data will not overlap with each other to prevent overfitting. The final validation results were the mean value obtained by the five-fold CV scheme. The predictive performance of the proposed approach is verified by five different measurements, including accuracy (Acc), precision (PR), sensitivity (Sens), specificity (Spec), and MCC. They can be represented by

$$Acc=\frac{TP+TN}{TP+FP+TN+FN}(7)$$

$$PR=\frac{TP}{TP+FP}(8)$$

$$Sens=\frac{TP}{TP+FN}(9)$$

$$Spec=\frac{TN}{FP+TN}(10)$$

$$MCC=\frac{TN\times TP-FP\times FN}{\sqrt{(TP+FP)\times (TP+FN)\times (TN+FN)\times (TN+FP)}}(11)$$

where TP, FP, TN, and FN are associated with the number of true positive, false negative, true negative, and false negative, respectively. In addition, receiver operating characteristic (ROC) curves (Hand, 2009) were plotted for better accessing the predictive performance of the proposed model. Furthermore, AUC (area under ROC curve) Huang and Ling (2005) values were also used as an evaluation criterion.

Predictive Performance of Our Model on Three Plant Datasets

We validated the predictive performance of the proposed model on three plant PPI datasets by five-fold CV scheme, including A. thaliana, Z. mays, and O. sativa. It can be observed from Table 1 that the average accuracy (Acc), precision (PR), sensitivity (Sens), specificity (Spec), and Matthews correlation coefficient (MCC) and AUC values obtained on the A. thaliana dataset are 71.48%, 66.64%, 86.09%, 56.88%, 44.94%, and 0.8369, respectively. Their SDs are 0.69, 0.89, 1.08, 2.21, 1.14, and 0.36%, respectively. Table 2 lists the prediction results obtained on the Z. mays dataset, from which we can see the average Acc of 85.41%, PR of 81.54%, Sens of 91.67%, Spec of 79.17%, MCC of 71.43%, and AUC of 0.9466, respectively. Their SDs are 1.18, 2.38, 1.18, 3.24, 2.00, and 0.26%, respectively. On the O. sativa dataset, shown in Table 3, our model performs at an Acc of 82.60%, PR of 75.79%, Sens of 95.89%, Spec of 69.31%, MCC of 67.65%, and AUC of 0.9442, with SDs of 1.79, 2.43, 0.91, 3.53, 2.98, and 0.58%, respectively. Figures 2–4 illustrate the ROC curves yielded on A. thaliana, Z. mays, and O. sativa datasets. In the figure of ROC curves, x-axis is the false positive rate and y-axis represents the true positive rate.

TABLE 1

Table 1. Five-fold CV results performed on the A. thaliana dataset by the proposed model.

TABLE 2

Table 2. Five-fold CV results performed on the Zea mays dataset by the proposed model.

TABLE 3

Table 3. Five-fold CV results performed on the Oryza sativa dataset by the proposed model.

FIGURE 2

Figure 2. The ROC curves of our approach on the A. thaliana dataset under five-fold CV.

FIGURE 3

Figure 3. The ROC curves of our approach on the Zea mays dataset under five-fold CV.

FIGURE 4

Figure 4. The ROC curves of our approach on the Oryza sativa dataset under five-fold CV.

Based on the experimental results, it can be indicated that the proposed model is effective for identifying PPIs in plants. We attributed this better prediction performance to the powerful DHT–SVD descriptors and the excellent DNN classifier. The PSSM not only encodes the sequence into matrix but also obtains the sufficient prior information of plant proteins. In addition, the application of DHT extracted robust feature descriptors from PSSM, and then, SVD algorithm was employed to reduce the noise and decrease the dimension of feature matrix that can better improve the prediction performance. As a popular deep learning classifier, DNN shows the powerful ability for training and predicting, which makes us more convinced that our method can be a useful tool for plant PPI prediction.

Comparison With Random Forest and K-Nearest Neighbor Classifier

There are many machine learning classifiers that have been applied to predict PPIs. K-nearest neighbor (KNN) (Keller et al., 1985) and random forest (RF) (Breiman, 2001) are the most widely used algorithms. The KNN algorithm is one of the simplest classification approaches and it has been widely applied to detect PPIs (Li et al., 2009). RF is a decision tree–based ensemble learning method, and it is known for its powerful ability of classification (Li et al., 2012). To further verify the predictive ability of DNN classifier, we compared it with the KNN and RF model by the five-fold CV scheme and adopted the same DHT feature descriptors. The results list in Table 4 illustrates that our method achieved higher AUC values across the A. thaliana, Z. mays, and O. sativa datasets. It can be observed that the average AUC values of the DNN classifier are 0.1023, 0.1215, and 0.1354 higher than those of KNN classifier. Similarly, when compared with the RF classifier, the AUC value of our model improved 0.0036, 0.013, and 0.0241, respectively. From the comparison results shown in Figure 5, we considered that the combination of DNN classifier and DHT descriptors can significantly improve the performance in plant PPI prediction.

TABLE 4

Table 4. Five-fold CV results yielded by KNN and RF classifier on the three plant PPI datasets.

FIGURE 5

Figure 5. Comparison results of AUC values obtained by deep neural network (DNN), K-nearest neighbor (KNN), and random forest (RF) classifiers on the three plant PPI datasets.

Comparison of Position-Specific Scoring Matrix With Different Protein Representation Methods

To evaluate the performance of PSSM, we compared it with the substitution matrix representation (SMR), which was proposed by Yu et al. (2012) to represent protein sequence. In this section, we employed the BLOSUM62 matrix to encode the A. thaliana protein sequence as a 20 × 20 matrix. Then, the DHT algorithm was applied to extract feature descriptors from SMR matrix and SVD was also adopted to reduce the feature dimensions. By this way, we can generate a 600-dimensional SMR–DHT descriptor for each protein pair. The five-fold CV results of SMR–DHT descriptors combined with DNN classifier on the A. thaliana dataset are summarized in Table 5. It can be observed that the PSSM-based method performs significantly better than the SMR-based method. For example, the accuracy and AUC gaps between PSSM and SMR-based method are 4.38 and 4.94%, respectively. The higher predictive accuracy and lower SDs further indicated that our method performs better than the SMR-based approach (Figure 6).

TABLE 5

Table 5. Comparison of PSSM with SMR-based method on the A. thaliana dataset.

FIGURE 6

Figure 6. ROC curves obtained from SMR-based method on the A. thaliana dataset.

Comparison With Different Feature Extraction Methods

To illustrate the effectivity of our feature extraction approach, we compared DHT with some popular correlative methods, including discrete cosine transform (DCT) (Ahmed et al., 1974), fast Fourier transform (FFT) (Nussbaumer, 1981), discrete wavelet transform (DWT) (Nanni et al., 2012), and auto-covariance (AC) (Zeng et al., 2009). As shown in Table 6 and Figure 7, on the O. sativa dataset, our method obtained a high prediction accuracy of 82.60%. The prediction accuracy values of other methods are 80.95, 75.31, 81.54, and 66.63%, respectively. Our method performs better than the other four methods. Especially compared with the AC-based method, our approach improved the Acc, Spec, MCC, and AUC by over 15%, and PR and Sens by over 7%, respectively. Although the Sens value of our method is not the highest, it still obtains an excellent value of 95.89%. The Acc, PR, Sens, Spec, MCC, and AUC values obtained from our model are 1.06, 0.69, 1.08, 1.05, 2.15, and 1.31% higher than the values of the DWT-based method. These comparison results further indicated the superiority of the proposed method.

TABLE 6

Table 6. Performance comparison of the DHT with different feature extraction methods on Oryza sativa dataset.

FIGURE 7

Figure 7. Five-fold CV results obtained by DNN classifier with different feature descriptors on the Oryza sativa dataset. (A) is the ROC curves obtained by DCT descriptors; (B) is the ROC curves obtained by FFT descriptors; (C) is the ROC curves obtained by DWT; (D) is the ROC curves obtained by AC.

Predictive Ability on Yeast and Human Dataset

To further validate the potential of the presented method, we performed it on the yeast and human PPI dataset, which was introduced by Guo et al. (2008) and Huang et al. (2015). The predictive results of the two datasets are listed in Tables 7, 8, and the corresponding ROC curves are shown in Figures 8, 9. When performing on the yeast dataset, it achieved average Acc, PR, Sens, Spec, MCC, and AUC value of 79.54%, 73.46%, 92.63%, 66.47%, 61.27%, and 0.9203, with SDs of 1.43, 2.11, 1.18, 3.60, 2.16, and 0.46%, respectively. From Table 8, it can be observed that the proposed model yielded great results on the human dataset, an average Acc of 82.76%, PR of 75.79%, Sens of 94.18%, Spec of 72.30%, MCC of 67.72%, and AUC of 0.9473, with SDs of 1.68, 2.79, 1.64, 4.74, 2.37, and 0.26%, respectively. From these results, we can observe that the powerful DNN-based classifier combined with the DHT feature descriptor is accurate and robust for exploring cross-species predictions of PPIs.

TABLE 7

Table 7. Five-fold CV results performed on the yeast dataset by the proposed model.

TABLE 8

Table 8. Five-fold CV results performed on the human dataset by the proposed model.

FIGURE 8

Figure 8. ROC curves performed by the proposed model on yeast dataset.

FIGURE 9

Figure 9. ROC curves performed by the proposed model on human dataset.

Discussion

In this article, we proposed a deep learning framework to predict PPIs in plants only using the information of amino acid sequence. This approach is based on DNN combined with DHT descriptors and PSSM. More specifically, we first used the PSSM to represent plant protein sequences, and then extracted feature vectors from these matrices by DHT. To improve the prediction accuracy and reduce the computational complexity, the SVD algorithm was adopted to reduce the feature dimensions. Lastly, these feature descriptors were sent to the DNN classifier for training and predicting. To verify the performance of the proposed approach, we performed it on A. thaliana, Z. mays, and O. sativa datasets. To evaluate the power of the DNN-based classifier, we compared it with the KNN and RF classifier using the same DHT descriptors. In addition, we also compared the DHT with some different feature descriptors. To further indicate the generality of our model, we also applied it to the yeast and human datasets. The experimental results indicated that our model performs significantly well in predicting PPIs in plants. In further work, we will continue to design more effective computational models for better analyzing biomolecular interactions in plants.

Data Availability Statement

Publicly available datasets were analyzed in this study. This data can be found here: http://arabidopsis.org/; http://www.ebi.ac.uk/intact; http://www.thebiogrid.org/; http://comp-sysbio.org/ppim; http://bis.zju.edu.cn/prin/.

Author Contributions

JP, L-PL, and Z-HY: conceptualization, methodology, software, validation, formal analysis, investigation, resources, and data curation. C-QY and Z-HR: writing – original draft preparation, writing, review, editing, visualization, and supervision. Y-JG: project administration. Z-HY: funding acquisition. All authors read and approved the final manuscript.

Funding

This research was funded by the National Natural Science Foundation of China, grant numbers 62002297 and 61722212.

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.

The reviewer Z-AH declared past co-authorships with one of the author Z-HY and the reviewer HY-a declared past co-authorships with two of the authors Z-HY and C-QY to the handling Editor.

Publisher’s Note

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.

Acknowledgments

Our deepest gratitude goes to the editor Robert Friedman and three reviewers for their careful work and thoughtful suggestions that have helped improve this manuscript substantially.

Footnotes

1. ^ https://www.arabidopsis.org/
2. ^ https://www.ebi.ac.uk/intact/
3. ^ https://thebiogrid.org/
4. ^ http://comp-sysbio.org/ppim/
5. ^ http://systemsbiology.cau.edu.cn/agriGOv2/
6. ^ http://bis.zju.edu.cn/prin/
7. ^ http://blast.ncbi.nlm.nih.gov/Blast.cgi

References

Ahmed, N., Natarajan, T., and Rao, K. R. (1974). Discrete cosine transform. IEEE Trans. Comput. 100, 90–93. doi: 10.1109/T-C.1974.223784

CrossRef Full Text | Google Scholar

Altschul, S. F., and Koonin, E. V. (1998). Iterated profile searches with PSI-BLAST—a tool for discovery in protein databases. Trends Biochem. Sci. 23, 444–447. doi: 10.1016/s0968-0004(98)01298-5

CrossRef Full Text | Google Scholar

Armean, I. M., Lilley, K. S., and Trotter, M. W. (2013). Popular computational methods to assess multiprotein complexes derived from label-free affinity purification and mass spectrometry (AP-MS) experiments. Mol. Cell. Proteomics 12, 1–13. doi: 10.1074/mcp.r112.019554

PubMed Abstract | CrossRef Full Text | Google Scholar

Bracewell, R. N., and Bracewell, R. N. (1986). The Fourier Transform And Its Applications. New York: McGraw-Hill.

Google Scholar

Bracha-Drori, K., Shichrur, K., Katz, A., Oliva, M., Angelovici, R., Yalovsky, S., et al. (2004). Detection of protein–protein interactions in plants using bimolecular fluorescence complementation. Plant J. 40, 419–427. doi: 10.1111/j.1365-313X.2004.02206.x

PubMed Abstract | CrossRef Full Text | Google Scholar

Breiman, L. (2001). Random forests. Mach. Learn. 45, 5–32. doi: 10.1023/A:1010933404324

CrossRef Full Text | Google Scholar

Canovas, F. M., Dumas-Gaudot, E., Recorbet, G., Jorrin, J., Mock, H. P., and Rossignol, M. (2004). Plant proteome analysis. Proteomics 4, 285–298. doi: 10.1002/pmic.200300602

PubMed Abstract | CrossRef Full Text | Google Scholar

Causier, B., and Davies, B. (2002). Analysing protein-protein interactions with the yeast two-hybrid system. Plant Mol. Biol. 50, 855–870. doi: 10.1023/A:1021214007897

CrossRef Full Text | Google Scholar

Chen, M., Ju, C. J.-T., Zhou, G., Chen, X., Zhang, T., Chang, K.-W., et al. (2019). Multifaceted protein–protein interaction prediction based on siamese residual rcnn. Bioinformatics 35, i305–i314. doi: 10.1093/bioinformatics/btz328

PubMed Abstract | CrossRef Full Text | Google Scholar

Cizek, V. (1970). Discrete hilbert transform. IEEE Tran. Audio Electroacoustics 18, 340–343. doi: 10.1109/TAU.1970.1162139

CrossRef Full Text | Google Scholar

Davies, M. N., Secker, A., Freitas, A. A., Clark, E., Timmis, J., and Flower, D. R. (2008). Optimizing amino acid groupings for GPCR classification. Bioinformatics 24, 1980–1986. doi: 10.1093/bioinformatics/btn382

PubMed Abstract | CrossRef Full Text | Google Scholar

Du, X., Sun, S., Hu, C., Yao, Y., Yan, Y., and Zhang, Y. (2017). DeepPPI: boosting prediction of protein–protein interactions with deep neural networks. J. Chem. Inform. Model. 57, 1499–1510. doi: 10.1021/acs.jcim.7b00028

PubMed Abstract | CrossRef Full Text | Google Scholar

Fang, Y., Macool, D., Xue, Z., Heppard, E., Hainey, C., Tingey, S., et al. (2002). Development of a high-throughput yeast two-hybrid screening system to study protein-protein interactions in plants. Mol. Genet. Genomics 267, 142–153. doi: 10.1007/s00438-002-0656-7

PubMed Abstract | CrossRef Full Text | Google Scholar

Fukao, Y. (2012). Protein–protein interactions in plants. Plant Cell Physiol. 53, 617–625. doi: 10.1093/pcp/pcs026

PubMed Abstract | CrossRef Full Text | Google Scholar

Gribskov, M., Mclachlan, A. D., and Eisenberg, D. (1987). Profile analysis: detection of distantly related proteins. Proc. Natl. Acad. Sci. U. S. A. 84, 4355–4358. doi: 10.1073/pnas.84.13.4355

PubMed Abstract | CrossRef Full Text | Google Scholar

Gu, H., Zhu, P., Jiao, Y., Meng, Y., and Chen, M. (2011). PRIN: a predicted rice interactome network. BMC Bioinformatics 12:161. doi: 10.1186/1471-2105-12-161

PubMed Abstract | CrossRef Full Text | Google Scholar

Guo, Y., Yu, L., Wen, Z., and Li, M. (2008). Using support vector machine combined with auto covariance to predict protein–protein interactions from protein sequences. Nucleic Acids Res. 36, 3025–3030. doi: 10.1093/nar/gkn159

PubMed Abstract | CrossRef Full Text | Google Scholar

Hand, D. J. (2009). Measuring classifier performance: a coherent alternative to the area under the ROC curve. Mach. Learn. 77, 103–123. doi: 10.1007/s10994-009-5119-5

CrossRef Full Text | Google Scholar

Hashemifar, S., Neyshabur, B., Khan, A. A., and Xu, J. (2018). Predicting protein–protein interactions through sequence-based deep learning. Bioinformatics 34, i802–i810. doi: 10.1093/bioinformatics/bty573

PubMed Abstract | CrossRef Full Text | Google Scholar

Hayashi, T., Matsuzaki, Y., Yanagisawa, K., Ohue, M., and Akiyama, Y. (2018). MEGADOCK-Web: an integrated database of high-throughput structure-based protein-protein interaction predictions. BMC Bioinformatics 19:62. doi: 10.1186/s12859-018-2073-x

PubMed Abstract | CrossRef Full Text | Google Scholar

Hinton, G., Vinyals, O., and Dean, J. (2015). Distilling the knowledge in a neural network. arXiv [Preprint]. arXiv:1503.02531

Google Scholar

Hinton, G. E., Osindero, S., and Teh, Y.-W. (2006). A fast learning algorithm for deep belief nets. Neural Comput. 18, 1527–1554. doi: 10.1162/neco.2006.18.7.1527

PubMed Abstract | CrossRef Full Text | Google Scholar

Hinton, G. E., and Salakhutdinov, R. R. (2006). Reducing the dimensionality of data with neural networks. Science 313, 504–507. doi: 10.1126/science.1127647

PubMed Abstract | CrossRef Full Text | Google Scholar

Huang, J., and Ling, C. X. (2005). Using AUC and accuracy in evaluating learning algorithms. IEEE Trans. Knowl. Data Eng. 17, 299–310. doi: 10.1109/tkde.2005.50

CrossRef Full Text | Google Scholar

Huang, Y.-A., You, Z.-H., Gao, X., Wong, L., and Wang, L. (2015). Using weighted sparse representation model combined with discrete cosine transformation to predict protein-protein interactions from protein sequence. BioMed Res. Int. 2015, 1–10, doi: 10.1155/2015/902198

PubMed Abstract | CrossRef Full Text | Google Scholar

Keller, J. M., Gray, M. R., and Givens, J. A. (1985). A fuzzy k-nearest neighbor algorithm. IEEE Trans. Syst. Man Cybern. 15, 580–585. doi: 10.1109/TSMC.1985.6313426

CrossRef Full Text | Google Scholar

Kerrien, S., Aranda, B., Breuza, L., Bridge, A., Broackes-Carter, F., Chen, C., et al. (2012). The IntAct molecular interaction database in 2012. Nucleic Acids Res. 40, D841–D846. doi: 10.1093/nar/gkr1088

PubMed Abstract | CrossRef Full Text | Google Scholar

Khan, I. K., and Kihara, D. (2016). Genome-scale prediction of moonlighting proteins using diverse protein association information. Bioinformatics 32, 2281–2288. doi: 10.1093/bioinformatics/btw166

PubMed Abstract | CrossRef Full Text | Google Scholar

Khan, S. H., Hayat, M., and Porikli, F. (2019). Regularization of deep neural networks with spectral dropout. Neural Netw. 110, 82–90. doi: 10.1016/j.neunet.2018.09.009

PubMed Abstract | CrossRef Full Text | Google Scholar

Kingma, D. P., and Ba, J. (2014). Adam: a method for stochastic optimization. arXiv [Preprint]. arXiv:1412.6980

Google Scholar

Klema, V., and Laub, A. (1980). The singular value decomposition: Its computation and some applications. IEEE Trans. Automat. Contr. 25, 164–176. doi: 10.1109/tac.1980.1102314

CrossRef Full Text | Google Scholar

Li, B.-Q., Feng, K.-Y., Chen, L., Huang, T., and Cai, Y.-D. (2012). Prediction of protein-protein interaction sites by random forest algorithm with mRMR and IFS. PLoS One 7:e43927. doi: 10.1371/journal.pone.0043927

PubMed Abstract | CrossRef Full Text | Google Scholar

Li, L., Jing, L., and Huang, D. (2009). “Protein-protein interaction extraction from biomedical literatures based on modified SVM-KNN,” in 2009 International Conference on Natural Language Processing and Knowledge Engineering, (Dalian, China: IEEE), 1–7. doi: 10.1109/NLPKE.2009.5313735

CrossRef Full Text | Google Scholar

Nanni, L., Brahnam, S., and Lumini, A. (2012). Wavelet images and Chou’s pseudo amino acid composition for protein classification. Amino Acids 43, 657–665. doi: 10.1007/s00726-011-1114-9

PubMed Abstract | CrossRef Full Text | Google Scholar

Nussbaumer, H. J. (1981). “The fast Fourier transform,” in Fast Fourier Transform and Convolution Algorithms (Berlin: Springer) 80–111.

Google Scholar

Onodera, R., Watanabe, H., and Ishii, Y. (2005). Interferometric phase-measurement using a one-dimensional discrete Hilbert transform. Opt. Rev. 12, 29–36. doi: 10.1007/s10043-005-0029-7

CrossRef Full Text | Google Scholar

Ponomareva, O., Ponomarev, A., and Ponomarev, V. (2018). “Evolution of forward and inverse discrete fourier transform,” in 2018 IEEE East-West Design & Test Symposium (EWDTS), (Kazan, Russia: IEEE), 1–5. doi: 10.1109/EWDTS.2018.8524820

CrossRef Full Text | Google Scholar

Read, R. R., and Treitel, S. (1973). The stabilization of two-dimensional recursive filters via the discrete Hilbert transform. IEEE Trans. Geosci. Electron. 11, 153–160. doi: 10.1109/tge.1973.294304

CrossRef Full Text | Google Scholar

Rhee, S. Y., Beavis, W., Berardini, T. Z., Chen, G., Dixon, D., Doyle, A., et al. (2003). The Arabidopsis Information Resource (TAIR): a model organism database providing a centralized, curated gateway to Arabidopsis biology, research materials and community. Nucleic Acids Res. 31, 224–228. doi: 10.1093/nar/gkg076

PubMed Abstract | CrossRef Full Text | Google Scholar

Richoux, F., Servantie, C., Borès, C., and Téletchéa, S. (2019). Comparing two deep learning sequence-based models for protein-protein interaction prediction. arXiv [Preprint]. arXiv:1901.06268

Google Scholar

Sledzieski, S., Singh, R., Cowen, L., and Berger, B. (2021). Sequence-based prediction of protein-protein interactions: a structure-aware interpretable deep learning model. bioRxiv [preprint]. doi: 10.1101/2021.01.22.427866

CrossRef Full Text | Google Scholar

Stark, C., Breitkreutz, B.-J., Reguly, T., Boucher, L., Breitkreutz, A., and Tyers, M. (2006). BioGRID: a general repository for interaction datasets. Nucleic Acids Res. 34, D535–D539. doi: 10.1093/nar/gkj109

PubMed Abstract | CrossRef Full Text | Google Scholar

Stark, H. (1971). An extension of the Hilbert transform product theorem. Proc. IEEE 59, 1359–1360. doi: 10.1109/proc.1971.8420

CrossRef Full Text | Google Scholar

Sun, T., Zhou, B., Lai, L., and Pei, J. (2017). Sequence-based prediction of protein protein interaction using a deep-learning algorithm. BMC Bioinformatics 18:277. doi: 10.1186/s12859-017-1700-2

PubMed Abstract | CrossRef Full Text | Google Scholar

Tian, T., Liu, Y., Yan, H., You, Q., Yi, X., Du, Z., et al. (2017). agriGO v2. 0: a GO analysis toolkit for the agricultural community, 2017 update. Nucleic Acids Res. 45, W122–W129. doi: 10.1093/nar/gkx382

PubMed Abstract | CrossRef Full Text | Google Scholar

Wang, Y., You, Z., Li, X., Chen, X., Jiang, T., and Zhang, J. (2017). PCVMZM: using the probabilistic classification vector machines model combined with a zernike moments descriptor to predict protein–protein interactions from protein sequences. Int. J. Mol. Sci. 18:1029. doi: 10.3390/ijms18051029

PubMed Abstract | CrossRef Full Text | Google Scholar

Xu, F., Zhao, C., Li, Y., Li, J., Deng, Y., and Shi, T. (2011). Exploring virus relationships based on virus-host protein-protein interaction network. BMC Syst. Biol. 5:S11. doi: 10.1186/1752-0509-5-S3-S11

PubMed Abstract | CrossRef Full Text | Google Scholar

Yang, L., Xia, J.-F., and Gui, J. (2010). Prediction of protein-protein interactions from protein sequence using local descriptors. Protein Pept. Lett. 17, 1085–1090. doi: 10.2174/092986610791760306

PubMed Abstract | CrossRef Full Text | Google Scholar

Yi, H.-C., You, Z.-H., Huang, D.-S., Li, X., Jiang, T.-H., and Li, L.-P. (2018). A deep learning framework for robust and accurate prediction of ncRNA-protein interactions using evolutionary information. Mol. Ther. Nucleic Acids 11, 337–344. doi: 10.1016/j.omtn.2018.03.001

PubMed Abstract | CrossRef Full Text | Google Scholar

Yu, X., Zheng, X., Liu, T., Dou, Y., and Wang, J. (2012). Predicting subcellular location of apoptosis proteins with pseudo amino acid composition: approach from amino acid substitution matrix and auto covariance transformation. Amino Acids 42, 1619–1625. doi: 10.1007/s00726-011-0848-8

PubMed Abstract | CrossRef Full Text | Google Scholar

Zahiri, J., Mohammad-Noori, M., Ebrahimpour, R., Saadat, S., Bozorgmehr, J. H., Goldberg, T., et al. (2014). LocFuse: human protein–protein interaction prediction via classifier fusion using protein localization information. Genomics 104, 496–503. doi: 10.1016/j.ygeno.2014.10.006

PubMed Abstract | CrossRef Full Text | Google Scholar

Zeng, M., Zhang, F., Wu, F.-X., Li, Y., Wang, J., and Li, M. (2020). Protein–protein interaction site prediction through combining local and global features with deep neural networks. Bioinformatics 36, 1114–1120. doi: 10.1093/bioinformatics/btz699

PubMed Abstract | CrossRef Full Text | Google Scholar

Zeng, Y.-H., Guo, Y.-Z., Xiao, R.-Q., Yang, L., Yu, L.-Z., and Li, M.-L. (2009). Using the augmented Chou’s pseudo amino acid composition for predicting protein submitochondria locations based on auto covariance approach. J. Theor. Biol. 259, 366–372. doi: 10.1016/j.jtbi.2009.03.028

PubMed Abstract | CrossRef Full Text | Google Scholar

Zhang, Y., Gao, P., and Yuan, J. S. (2010). Plant protein-protein interaction network and interactome. Curr. Genomics 11, 40–46. doi: 10.2174/138920210790218016

PubMed Abstract | CrossRef Full Text | Google Scholar

Zhu, G., Wu, A., Xu, X.-J., Xiao, P.-P., Lu, L., Liu, J., et al. (2016). PPIM: a protein-protein interaction database for maize. Plant Physiol. 170, 618–626. doi: 10.1104/pp.15.01821

PubMed Abstract | CrossRef Full Text | Google Scholar

Zhu, Y. M., Peyrin, F., and Goutte, R. (1990). The use of a two-dimensional Hilbert transform for Wigner analysis of 2-dimensional real signals. Signal Process. 19, 205–220. doi: 10.1016/0165-1684(90)90113-d

CrossRef Full Text | Google Scholar