{'fraction_non_alphanumeric': 0.03556070633444143, 'fraction_numerical': 0.016499435786391778, 'mean_word_length': 5.196145124716553, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 4, 'lorem ipsum': 0, 'www.': 1, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
SortPred: The first machine learning based predictor to identify bacterial sortases and their classes using sequence-derived information

Sortase enzymes are cysteine transpeptidases that embellish the surface of Gram-positive bacteria with various proteins thereby allowing these microorganisms to interact with their neighboring environment. It is known that several of their substrates can cause pathological implications, so researchers have focused on the development of sortase inhibitors. Currently, six different classes of sortases (A-F) are recognized. However, with the extensive application of bacterial genome sequencing projects, the number of potential sortases in the public databases has exploded, presenting considerable challenges in annotating these sequences. It is very laborious and time-consuming to characterize these sortase classes experimentally. Therefore, this study developed the first machine-learning-based two-layer predictor called SortPred, where the first layer predicts the sortase from the given sequence and the second layer predicts their class from the predicted sortase. To develop SortPred, we constructed an original benchmarking dataset and investigated 31 feature descriptors, primarily on five feature encoding algorithms. Afterward, each of these descriptors were trained using a random forest classifier and their robustness was evaluated with an independent dataset. Finally, we selected the final model independently for both layers depending on the performance consistency between cross-validation and independent evaluation. SortPred is expected to be an effective tool for identifying bacterial sortases, which in turn may aid in designing sortase inhibitors and exploring their functions. The SortPred webserver and a standalone version are freely accessible at: https://procarb.org/sortpred.


Introduction
The cysteine transpeptidase enzymes, commonly known as ''sortases" are present in all Gram-positive bacteria, some Gramnegative bacteria, and a few species of archaea [1,2]. These sortase enzymes covalently link proteins with their cell walls, thus regulating surface architecture [3]. Sortases encoded by pathogenic bacteria are known to recognize various proteins with pathological roles such as adhesion, immune response, and acquisition of required nutrients [4][5][6]. Therefore, sortases are one of the key factors for virulence, and may thus be used as a target for fighting bacterial infections [6]. In light of these factors, several studies have focused on identifying sortase inhibitors against methicillin-resistant bacteria [7] or bacteria that infect animals with significance in aquaculture [8]. The sortase inhibitors are expected to block the function of these sortases and have been extensively reviewed elsewhere [9,10]. Furthermore, sortase enzymes are known to be involved in a variety of industrial applications. One such important application is 'Sortagging' (sortase-mediated transpeptidation), a versatile chemoenzymatic ligation strategy for site-specific labelling of proteins with small probes [11], a strategy widely used to immobilize proteins on surfaces, labelling proteins, protein cyclization and protein dimerization [12].
Proteins that are recognized by sortase enzymes have cell wall sorting signal (CWSS) towards the C-terminal end, which includes a LPXTG (L: leucine, P: proline, X: any amino acid, T: threonine and G: glycine) recognition motif, a hydrophobic region of about 20 residues and a tail region with positively charged amino acids (lysine/arginine) [9]. Staphylococcus aureus sortase A (SaSrtA) is one of the most well-studied sortase enzyme. A two-step reaction https mechanism is involved in anchoring SaSrtA to the cell envelope. First, the SaSrtA enzyme cleaves the LPXTG motif between T and G residues, producing a thioester acyl-enzyme intermediate that is resolved and then transferred to the cell wall via a SrtAmediated transpeptidation reaction [9].
Sortases are grouped into different families based on their amino acid sequences (class A to F enzymes) [4]. Nevertheless, irrespective of their classification status, all these sortase enzymes share a few common features: a highly conserved catalytic triad consisting of amino acids HIS, CYS, and ARG [13,14]. On the other hand, in class F enzymes from Actinobacteria, a highly conserved ASN was present instead of an ARG [15]. Sortase enzymes bind a variety of substrates and thereby regulate different functions, including sporulation, pilus assembly, ion acquisition, and other general housekeeping roles of the cell [12]. Particularly, class A sortases present in Firmicutes perform cellular housekeeping functions. The class B sortases are also predominant in Firmicutes and have a wide variety of roles, including the attachment of haem-receptors to the peptidoglycan and pilus assembly. Class Ctype sortases are found in both Firmicutes and Actinobacteria, with the exception of Streptomyces family [15], which act as pilin polymerases to help pili formation. Sortases belonging to class D are predominant in Bacilli and are known to facilitate sporulation. Contrarily, class E and F enzymes are found in Actinobacteria, and their functional roles remain unknown [4]. However, studies have indicated that class E enzymes may play a role in developing aerial hyphae in Streptomyces coelicolor [16].
Despite the fact that the classification of these sortases has been updated regularly, majority of them have not been assigned to any sortase class. Due to the widespread sequencing of bacterial gen-omes, the number of potential sortase sequences has increased rapidly in the public databases, posing a greater challenge to annotate these sequences. Furthermore, experimental identification and classification of sortases are time consuming and expensive. Hence, computational approaches offer a robust means of accurately identifying sortase enzymes from their primary sequences. Currently, the only methods available to identify and classify sortases are based on the sequence-similarity approaches such as BLAST [17,18] and HMMER [19]. A major disadvantage of such methods is that they only work if the given sequence shares some degree of sequence similarity with the existing sortase sequences. As a result, these approaches are not efficient in detecting novel sortases. Therefore, machine learning (ML) based methods provide promising alternatives to develop prediction models for sortase classification.
In this study, we developed the first two-layer predictor called SortPred. The first layer identifies whether a given sequence belongs to sortase or not, and the second layer identifies one of the six classes (A-F) of the predicted sortase. An overall framework for SortPred is shown in Fig. 1. To develop the SortPred, we employed five different sequence-based encodings, including amino acid composition (AAC), composition/transition/distribution (CTD), conjoint triad (CTriad), dipeptide composition (DPC), and quasi-sequence-order (QSO), and their possible combinations (hybrid features). Afterward, these features are trained using an RF binary classifier for the first layer prediction and an RF multilabel classifier for the second layer prediction. Finally, we independently selected the best model for two layers based on the consistent cross-validation and independent evaluation results. To our knowledge, this is the first time a ML-based method has been used Fig. 1. An overview of the proposed methodology for predicting sortase enzymes. The benchmark and independent datasets for Layer 1 consist of sortases and non-sortases, whereas Layer 2 consists of sequences representing the individual sortase classes. Both layers use five composition-based and property-based features (AAC, CTD, CTriad, DPC & QSO) and their hybrids in a 10-fold cross validation using RF to identify the best models from each layer. During cross-validation, the SMOTE algorithm is used to handle the imbalance data for layer 2. The performance of each of the selected models is evaluated separately on the independent dataset for each layer. At last, if the sequence is predicted to be as a sortase enzyme, the sequence information is passed to Layer 2 for the prediction of the sortase class.
for predicting bacterial sortases and their classes. Therefore, we anticipate our method will be an effective tool for identifying bacterial sortases, which will be useful to design sortase inhibitors and to investigate their functions in various industrial applications.

Dataset construction
Positive dataset: We used the keyword ''sortase" to search against the NCBI's protein database to construct the positive samples. All bacterial sequences with a length ranging from 100 to 500 were retained and excluded other sequences, even those containing non-standard amino acids (B|J|O|U|X|Z). To annotate sortase sequences, position-specific scoring matrix (PSSM) searches against pre-formatted conserved domain database (CDD) [20], ''lit-tle_endian" (Downloaded: November 2020) were carried out by using a standalone RPS-BLAST v2.10.0+ [18] algorithm with an evalue threshold of 1e-5. For each input sequence, RPS-BLAST lists the conserved domain models that score above a certain cut-off and includes the PSSMID of the conserved domain, scores (e.g., evalue and bit score) and the actual alignment between the input sequence and the conserved domain. The output of the RPS-BLAST was further processed by running another command line utility ''rpsbproc" available from the CDD website (https://ftp. ncbi.nih.gov/pub/mmdb/cdd/rpsbproc/). The rpsbproc utility converts the raw alignments into domain or site annotations on the input sequence and presents the annotation data as tabdelimited files. From the rpsbproc utility output, sequences assigned to one of the six sortase classes (Classes A, B, C, D, E and F) were selected. Using these sortase sequences, a redundancy reduced dataset was generated by applying CD-HIT v4.8.1 [21] with the 40% sequence identity cut-off. Sequences annotated as sortases without being assigned to a particular class, as well as only a limited number of marine sortases (from proteobacteria) identified in the preceding steps, were also excluded from the positive dataset. Furthermore, redundancy reduction was applied to excluded sortase sequences as well, so that they could be used for additional validation later.
Negative dataset: We constructed negative dataset as follows: (i) retrieved all the reviewed bacterial sequences having a length between 100 and 500 amino acids from the UniProt database and discarded the sequences that contained non-standard amino acids. (ii) RPS-BLAST and the rpsbproc utility (described above) were used to identify the potential sortase sequences and excluded them from the negative dataset. (iii) We further filtered the negative dataset by removing any sequence that showed a greater than 30% sequence identity to sequences from the positive dataset. In the same way as the positive dataset, we also generated a negative dataset with a CD-HIT cut-off of 40% sequence identity. A prediction model developed using a balanced dataset is generally more reliable and robust than a model developed using an imbalanced dataset [22,23]. In an imbalanced dataset, the model is overfitted to favor the sample belonging to the large class. Therefore, we randomly selected negative samples that are equivalent in number to positive samples. The combined positive and negative datasets were divided into training and independent validation sets by using the createDataPartition function of the CARET (short for Classification And REgression Training) package [24] available in R (https://www.r-project.org/). In layer 1, we used 1663 sortases and 1660 non-sortases to develop the model, followed by 412 sortases and 415 non-sortases for independent validation. For layer 2, classes A, B, C, D, E, and F each contains 140, 462, 186, 242, 213, and 420 samples for multi-class training. Those classes corresponding to independent validation are 34, 115, 46, 59, 53, and 105. A statistical summary of the dataset is provided in Table S1.

Feature generation
This work aimed to train an RF classifier that can accurately map input features extracted from primary protein sequences in order to predict if a sequence is a sortase or non-sortase, and subsequently its class (A, B, C, D, E, or F). In particular, the training dataset contain sequences of diverse length that should be converted into fixed length feature vectors using feature encoding algorithms, which is essential for RF training. In our study, we employed five different features that have been extensively used in previous works [25][26][27], that cover major compositional and physicochemical aspects of sequence information and are described below:

Amino acid composition (AAC)
In protein sequence, the AAC consists of the fraction of each naturally occurring 20 amino acid residues, and can be calculated by using the following formula: where AA i is the number of amino acids of type i and K is the length of the protein sequence. The AAC has a fixed length of 20 features.

Composition (C), Transition (T), and Distribution (D) (CTD)
The CTD descriptors have been proposed by Dubchak et al. [28,29] for predicting protein folding classes, which have several applications, such as the prediction of protein/peptide functions. A total of twenty naturally occurring standard amino acids have been grouped into three groups (polar, neutral, and hydrophobicity) according to seven different types of physicochemical properties (Table S2), including hydrophobicity, polarizability, normalized van der Waals volume, secondary structure, polarity, charge, and solvent accessibility.
In CTD, C represents the percentage composition of polar, neutral, and hydrophobic residues of a given protein. The composition descriptor can be expressed as: where Z a is the number of amino acid of type a in the given sequence.
In CTD, T consists of three values (polar, neutral, and hydrophobic). A transition from a neutral group to a hydrophobic group is the frequency with which a neutral residue is followed by a hydrophobic residue or vice versa. The transitions between polar and neutral groups, and hydrophobic and polar groups, are also defined in the same way. T can be calculated as follows: where Z ab and Z ba respectively represent the numbers of dipeptide encoded as ab and ba in the sequences. In CTD, D consists of five values for each of the three classes, and it measures the percentage of a target sequence length within which amino acids belonging to a specific property are found within 25, 50, 75, and 100% of their position. Overall, CTD generates 147-dimensional features (21 Â 7), and each PCP is characterized by a 21-dimensional feature vector.

Conjoint triad (CTriad)
The CTriad encodings were initially proposed by Shen et al. [30] to model protein-protein interactions. Using this encoding, any given protein sequence is represented as a vector space containing descriptors of amino acids. Subsequently, the vector space is reduced by clustering the 20 amino acids based on their dipoles and side chains volumes. As a result, the CTriad encoding generates a 343-dimensional feature vector for a given protein sequence.

Dipeptide composition (DPC)
DPC gives a fixed length of 400 (20 Â 20) features, which is defined as: 5. Quasi-Sequence-Order (QSO) QSO encoding of each protein sequence results in a fixed length of a 100-dimensional feature vector by measuring the physicochemical distance between the amino acids. A set of equations and details regarding the QSO feature encoding have been presented in previous studies [31,32].

Machine learning classifier and parameter optimization
In this study, we employed an RF classifier. Using the widely used open-source R package CARET [24], we generated several RF models based on the five main features described above and all possible combinations. In developing each feature-based model, a grid-based search was applied and parameters 'mtry' (number of variables randomly selected at each node split) and 'ntree' (number of trees to grow) were optimized. Here, mtry search space is set to 1 to 10, with a step size of 1, and ntree search space is set to 100 to 700 with a step size of 20.
Using the 10-fold cross-validation (CV) approach, we assessed the performances of a given set of feature encodings and parameters. Subsequently, selected the optimal parameter that eventually achieved the best performance. In the 10-fold CV, the training data was randomly divided into 10 subsets of which one was used as a test set and the remaining nine subsets were used for training [33,34]. Ten times this procedure was repeated in order to make sure each subset was used as a test set at least once. The performance of the 10 corresponding outcomes is averaged, with the result implying classifier's overall performance.

Performance evaluation metrics
Six commonly used metrics were used [35][36][37] to evaluate the performance of constructed models, including sensitivity (Sn), specificity (Sp), accuracy (ACC), balanced accuracy (BACC), F1score and Matthews correlation coefficient (MCC). These performance metrics are calculated as follows: where TP, TN, FP, and FN represent the true positive, true negative, false positive, and false negative, respectively. In all cases, the higher the value, the better.

Handling imbalanced dataset by SMOTE algorithm
As explained in the above section (dataset construction) the number of samples in each specific sortase class differed considerably. Consequently, the number of sequences in the respective classes are highly imbalanced. Generally, developing an MLbased model from an imbalanced dataset can be challenging because the performance skews in the majority's favor. Therefore, to address this issue, we applied SMOTE (Synthetic minority oversampling technique) algorithm [38] on the training data by using the SmoteClassif function available within the UBL (v0.0.7) package. The SMOTE algorithm uses a combination of oversampling the minority class and undersampling the majority class for better classification performance. The method has been used successfully in various studies to eliminate the class imbalance [39][40][41]. Finally, each sortase class consisted of 277 sequences in the balanced training dataset, except for class E, which contained 276 sequences.

Overall framework of SortPred
A two-step approach is more effective than a single predictor for the identification of sortase enzymes and their classes. In this work, we developed SortPred, a two-layer predictor (Fig. 1), where the first layer predicts whether a given sequence belongs to sortase enzyme or not. Using the predicted sortase sequence, the second layer predicts its class (A, B, C, D, E, and F). The two-layer framework was developed by exploring five different sequence encodings (AAC, DPC, CTD, CTriad, and QSO), along with 26 possible feature combinations. After that, each of the 31 descriptors was trained with a RF classifier using 10-fold CV and their performance was assessed. Notably, we employed a binary RF classifier for the first layer and a multi-class RF classifier for the second layer. The following section discusses various descriptors' performances in the first-and second-layer prediction. Fig. 2A shows the performance of various feature descriptors by employing the Layer 1 training dataset. Results demonstrate that DPC is the best performing feature descriptor among the five feature encodings, with an ACC of 94.9%, which is 2.9-8.8% higher than the four other features (AAC, CTD, CTriad, and QSO). Next, we examined the performance of hybrid features. In general, hybrid features have better prediction performance than their individual feature encoding contained within them. Interestingly, seven hybrid features (AAC_CTD_CTriad_DPC_QSO, AAC_CTD__DPC_QSO, AAC_C-Triad_DPC_QSO, CTD_CTriad_DPC_QSO, CTD_DPC_QSO, CTriad_DPC_QSO, and DPC_QSO) achieved an ACC in the range of 95.8 to 96.4%, which is $ 1 to 1.5% higher than the DPC encoding. It is surprising that all seven encodings encompass DPC, indicating that DPC plays a major role whereas other encodings play a supporting role in classifying sortases from non-sortases. Generally, cross-validation performance alone is not enough to select the best model. There is a possibility that the excellent performance during cross-validation may be a result of overoptimization of the ML parameters [42][43][44]. As a result, we tested each model with an independent validation set and compared their performance consistency or robustness.

Performance of 31 descriptors on layer 1 independent validation dataset
An independent validation dataset was used to evaluate the performance of 31 models and the results are shown in Fig. 2B. Rather than solely focusing on independent performance, we compared the consistency of cross-validation and independent validation performance, particularly ACC. We observed inconsistencies in ACC between training and independent datasets for the five feature encodings (AAC, DPC, CTriad, CTD, and QSO) as shown in Fig. 2A and B. For instance, DPC was the best performer in training, but it ranked last. Similarly, QSO ranked third in training, but earned the best performance in the independent dataset. However, unlike five feature encodings, consistent performance was observed with seven hybrid features (AAC_CTD_CTriad_DPC, AAC_CTriad_DPC, AAC_DPC_QSO, CTD_CTriad_DPC, CTD_DPC_QSO, CTriad_DPC, and DPC_QSO), which achieved a $ 96.0% ACC on both datasets. Finally, we selected CTD_DPC_QSO as the final model for SortPred (the first layer prediction) because it contained three feature encodings that achieved a consistent ACC on the training dataset (96.2%) and the independent dataset (96.0%).

Performance of various feature descriptors in classifying sortase classes based on layer 2 training and independent datasets
We assessed the performance of various feature descriptors for sortase classes prediction using an imbalanced training dataset. Interestingly, when predicting the individual classes based on imbalanced data, the model based on QSO performed the best among all the five descriptors with an ACC and MCC scores of 92.2% and 0.682 (Table 1), respectively. An analysis of model performances based on ACC or BACC would not be straightforward because of the imbalance in the dataset. Chicco et al. [45] have recently demonstrated the importance of the MCC metrics by using the datasets that are imbalanced. Hence, we adopted MCC for model comparison. Note that QSO model achieved MCC that was 5.6-13.1% higher as compared to the other four encodings. Compared to layer 1, most of the hybrid feature-based performance deteriorated, containing redundant or irrelevant features that may not be suitable for class prediction. Only three of the 26 hybrid features containing QSO features (AAC_DPC_QSO, CTD_DPC_QSO, and DPC_QSO) exhibited similar performances with MCC between 0.691 and 0.703. Specifically, whose MCC is 0.9 to 2.1% higher than the QSO model, indicating QSO plays the central role in sortase class prediction, while other encodings play the supporting role. To ensure the robustness of the models, we evaluated all of them independently.
The independent validation assessment of 31 models is presented in Table 1. We examined only three hybrid models that demonstrated superior performance during the training. Out of three models, two (DPC_QSO and AAC_DPC_QSO) achieved the MCC in the range of 0.739-0.748. Finally, we selected DPC_QSO model as it exhibited the consistent cross-validation and independent performance. Next, we examined how DPC_QSO performed for each class on training and independent datasets. Results demonstrate that classes A, B, C, and F achieved excellent performance on the training dataset with MCCs ranging from 0.715 to 0.776, while class D achieved above-average performance with MCC of 0.633, and class E achieved moderate performance (Fig. 3A). Furthermore, we observed similar performance with the same ranking for each class in the independent dataset (Fig. 3B).

SMOTE improves the layer 2 prediction performance on training and independent datasets
The sortase classes (A, B, C, D, E, and F) used in this study are highly imbalanced. Therefore, to balance the sample, we applied the SMOTE resampling technique and obtained an equal number of samples for each class. Table 2 shows that three hybrid features (AAC_DPC, CTriad_DPC_QSO, and DPC_QSO) achieved MCC in the range of $ 0.85 on the training dataset and $ 0.80 on the independent assessment, which is significantly better than that of the other 28 models. Furthermore, among these three hybrid features, we have selected CTriad_DPC_QSO, which has the best MCC of 0.860 and 0.798, respectively, during cross-validation and independent validation. To demonstrate the superiority of the SMOTE algorithm, we compared the CTriad_DPC_QSO model performance with the  DPC_QSO model based on the imbalanced dataset. Fig. 4 indicates that the balanced sample generated by the SMOTE algorithm consistently improved the performance in all five metrics, not only in the training dataset but also in the independent dataset. Next, we compared the class-based performance between the best models derived from balanced and imbalanced datasets (Fig. 5). Cross-validation analysis, showed that sortase classes A, B, C, D, E, and F improved by 19.629, 10.582, 15.696, 13.933, 29.94, and 8.42%, respectively. However, in the case of independent validation, A and D exhibit similar performance. The remaining classes B, C, E, and F improved by 5.113, 5.166, 13.714, and 5.289%, respectively. As the SMOTE-based CTriad_DPC_QSO model achieved superior performance in identifying sortase classes, we chose it for layer 2 prediction. Usually, the developed predictor is compared with the existing predictors to demonstrate the advantages of the proposed approach. However, given that this is the first proposed predictor, we must exclude a comparison.

Performance comparison of RF with different classifier on both layers
To demonstrate the superiority of the RF algorithm, we employed three different commonly used classifiers, namely Support Vector Machines (SVM), Naive Bayes (NB), and K Nearest Neighbors (KNN), whose optimal models for 31 different descriptors independently were developed for both layers using the same training datasets and 10-fold CV. Tables S3 and S4 provide a performance comparison of RF and other classifiers on training datasets for layers 1 and layer 2. Based on ACC, the RF consistently outperforms the other classifiers regardless of the encodings on both layers, suggesting that RF is the most suitable classification algorithm for discriminating between sortase and non-sortase, and their classes. Thus, we chose RF as the final classifier. In the future, when large-scale training datasets become available, additional algorithms can be applied to determine if they improve the performance.

Case studies
We examined the performance of SortPred on a variety of datasets in order to demonstrate the potential applications of this method. The performance results are presented below according to the dataset.
1. We then used another independent dataset, which consisted of non-redundant sequences of 736 (including 10 proteobacterial sortases) sortase sequences not included in the training dataset. Sortases in this dataset were either not assigned to any specific class or represent very few proteobacterial sortases. SortPred was able to correctly predict 547 (74.32%) of the 736 sequences as sortases with an average probability score of 0.703 (±0.10). The majority of these predicted sortases were assigned to class D (2 2 8), followed by F (1 1 1), E (75), B (69), A (49), and C (14) classes. Additionally, SortPred successfully predicted 8/10 of the 10 marine sortases (proteobacterial sortases) that were not part of either the training or validation sets (Table 3). 2. As an additional evaluation of SortPred's ability to predict various sortase enzymes from well-known bacteria for which the genome data are available, we retrieved the proteomes of eight different bacterial strains. Specifically, there were two proteomes each from Corynebacterium diphtheriae and Streptococcus pneumoniae strains followed by one proteome each from Staphylococcus aureus, Streptomyces coelicolor, Syntrophothermus lipocalidus, and Lactobacillus plantarum, respectively. Some of these organisms are model organisms and the experimental characterization of sortases in their genomes have been established [46,47]. As described in the methods section, we first excluded the sequences that did not meet the selection criteria.  Table 3 Prediction results for 10 Gram negative proteobacterial sortase sequences. SortPred correctly identified 8/10 sortases and attempted to assign class (A-F) to each of the input sequences with probability scores. X indicates that the given sequence was not identified as a sortase. sequences for which RPS-BLAST was unable to determine a class. SortPred, on the other hand, predicted and attempted to classify each of these sequences, including those associating with proteobacterial (assigned to class D) origin. Generally, SortPred classified proteobacterial sortases as class D enzymes (Table S6).

ID
In summary, the results of our study suggest that our proposed approach (SortPred) using sequence derived features may yield an effective method for predicting bacterial sortases, especially for the newly released sequences, and demonstrate that our method can also be successfully applied to identify sortase sequences from gram-negative bacteria (proteobacteria).

Conclusions
In recent years, a great deal of success has been achieved with ML models in learning complex patterns that enable them to predict the data that has not yet been seen [48]. ML algorithms parse the known data and learn from it and make predictions regarding any new datasets [49,50]. An early application of ML algorithms in protein science was reported about two decades ago, where a logic based approach was used to predict the secondary structure of the proteins [51]. Since then, various aspects of protein science have been addressed with the aid of ML methods [52][53][54]. Considering the power of ML to deal with a wide variety of features simultaneously, as well as its ability to capture the hidden relationships [55][56][57][58][59], we used one of the common ML algorithms known as RF for the prediction of sortase enzymes. This is the first time a MLbased method has been applied for the prediction of sortase enzymes and their classes.
The two-layer predictor is quite famous in the field of bioinformatics for identifying different information about predicted positive sample [60,61]. This multiple information will help experimentalists while selecting the putative candidates. In this regard, we developed a two-layer novel predictor called SortPred, which allow us to identify the sortase and their classes based on the sequence information. Firstly, we constructed a novel dataset and partitioned it separately for the first and the second layer model development. At the first layer, a balanced dataset and binary classifier are used, while at the second layer, the SMOTE algorithm is used to generate the balanced dataset and multi-label classifier. To develop SortPred, we explored five different feature encoding algorithms and possible combinations, with the corresponding prediction model developed based on RF. Then, we used an independent validation set to assess the robustness of each model. In the end, the final model for the first layer and the second layer was selected based on the robustness. Our prediction model is publicly available at: https://procarb.org/sortpred/. Further improvements to the proposed approach can be achieved by exploring other ML algorithms such as decision tree-based [62], neural network-based algorithms [63][64][65], incorporating novel features and classical computational approaches used in other studies. Furthermore, we expect that our work will spark interest in predicting sortase enzymes using ML methods, and the performance will improve even further as more balanced data becomes available.

Funding
This work was fully supported by the National Research Foundation of Korea (NRF) funded by the Korean government (MSIT) (2021R1I1A1A01056363 and 2021R1A2C1014338).

Declaration of Competing Interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.