# Graph pyramids for protein function prediction

- 516 Downloads
- 1 Citations

## Abstract

### Background

Uncovering the hidden organizational characteristics and regularities among biological sequences is the key issue for detailed understanding of an underlying biological phenomenon. Thus pattern recognition from nucleic acid sequences is an important affair for protein function prediction. As proteins from the same family exhibit similar characteristics, homology based approaches predict protein functions via protein classification. But conventional classification approaches mostly rely on the global features by considering only strong protein similarity matches. This leads to significant loss of prediction accuracy.

### Methods

Here we construct the Protein-Protein Similarity (PPS) network, which captures the subtle properties of protein families. The proposed method considers the local as well as the global features, by examining the interactions among 'weakly interacting proteins' in the PPS network and by using hierarchical graph analysis via the graph pyramid. Different underlying properties of the protein families are uncovered by operating the proposed graph based features at various pyramid levels.

### Results

Experimental results on benchmark data sets show that the proposed hierarchical voting algorithm using graph pyramid helps to improve computational efficiency as well the protein classification accuracy. Quantitatively, among 14,086 test sequences, on an average the proposed method misclassified only 21.1 sequences whereas baseline BLAST score based global feature matching method misclassified 362.9 sequences. With each correctly classified test sequence, the fast incremental learning ability of the proposed method further enhances the training model. Thus it has achieved more than 96% protein classification accuracy using only 20% per class training data.

### Keywords

Protein classification Protein homology Protein-Protein similarity network Network biology## Background

The life of an organism is encrypted in the sequence of a genome, but decryption of the genetic information depends upon functions of the proteins that it encodes. The assignment of biological or biochemical roles to proteins has many challenges. Knowing just amino-acid sequence and structure of a protein does not guarantee that we can predict everything about that protein. However these measures are a good starting point for quickly predicting protein functions with the help of known homology. There are plenty of proteins which have totally unknown functions and the whole genome sequencing projects are major sources of these. So an approach based on protein homology is a fast, approximate and a primary way used to tackle such a daunting task of protein function prediction. The rationale behind this is that two proteins with similar sequence or structure could evolve from a common ancestor and thus have similar functions.

The homology of protein sequence is usually found by assessing similarity between pairs of sequences. An optimal algorithm based on dynamic programming like Needleman-Wunsch [1] is computationally inefficient for searching similar sequences in the large protein database. So most of the existing methods use suboptimal algorithms like BLAST [2] for matching a pair of sequences. Searching for only the highest scoring match in a protein database is nothing but looking for the global feature in the sequence similarity space.

In attempts to overcome the above limitations, various matching methods have been developed that use the features extracted from multiple sequence alignment (MSA) of the protein family sequences. These methods use sequence templates [7] and profiles of the sequences [8] as features. They ask for accurate MSA of related sequences with low residue identities which requires some domain expertise. These profile based methods use ad hoc scoring systems without associating any evolutionary meaning to it [9], unlike PAM or BLOSUM [10]. These factors put limitations over these methods for using them for large protein databases.

Pattern recognition based only on local features could be useful for analyzing the large amount of data in real time like abnormal event detection from video [11]. Use of only local features is a trade-off between speed and the accuracy. Domains like biometrics, as well as bioinformatics, require high recognition accuracy as well as reliability. So methods which fuse local and global features have improved recognition performance [12].

MSA of a protein family reveals selective pressures for conservation of specific residues with evolutionary functional importance. Some MSA regions seem to tolerate insertions and deletions while others tend to remain conserved. So position-specific features from MSA are desirable when searching databases for homologies. Profile HMM, a generative model used widely for protein sequence classification, uses these position-specific features [13]. It uses global as well as local features by considering multiple sequences at the same time. But it lacks quick and incremental training functionality. After classification of a test sequence by profile HMM, to update the training model, MSA need to be calculated again and after that the new model parameters will be estimated from it. MSA is a time consuming process and also limits the number of sequences to be used for sequentially updating the training model. Unlike profile HMM, in the proposed graph based method, incremental training is performed easily and quickly. Test sequences can be easily added, either sequentially or all at a time, to the original graph to produce the new trained graph. This puts no limit on the number of test sequences to be added for updating the training model. In fact, the more new correct sequences added, the better the model will become.

Methods based on similarity clustering, k-nearest neighbors, phylogenetic clustering [14], gene fusion analysis [15] look for closely interacting sequences near the query sequence. They fail to account for interactions among the closely interacting neighborhood. Thus it leaves room for further performance improvement.

Intermediate sequence search (ISS) has also been successfully used for detecting remote homology [16]. For the sequences whose homology cannot be established by a direct comparison, ISS attempts to relate them through a third weakly interacting sequence with them. Thus for detection of remotely related protein sequences, use of intermediate sequences has been known to increase the predictive power significantly [17]. However, use of intermediate sequences can propagate errors dramatically when they are not of the same function. Excessive inclusion of the false positives can be effectively controlled by using graph theory. For example, Kim and Lee [18] used biconnectedness and articulation points to control the false positives effectively in an iterative manner. However, the relationships among sequences become very complicated as the number of sequences increases, so these relationships should be defined at multiple levels in a systematic manner. Thus our graph pyramid approach is an important solution for tackling above issues. The proposed method tightly controls false positives by considering strong interactions (global features) as well as all weak interactions (local features) in the graph with a hierarchical manner.

Protein-Protein Interaction (PPI) [19] plays a critical role in many biological processes. Protein expresses its functions when it interacts with the other proteins [20]. So PPI is a vital information for protein function prediction. On the other hand, understanding protein functions is critical for understanding the various biological processes [21]. PPI is modeled as a network, with protein sequences represent the nodes and biological protein interactions depict the edges in the network [19]. Protein function prediction methods based on PPI are promising as well as producing high performance but the availability of high throughput PPI data is an essential requirement for them [20, 21]. So we propose a graph based protein classification method, which requires only amino-acid protein sequences as an input data. An edge in the graph is constructed by using the protein sequence similarity measure instead of PPI to produce the new Protein-Protein Similarity (PPS) network.

### Motivation and contributions

Relationships among biological sequences can be effectively represented by building a PPS network. However, in protein families, modularity, local clustering and scale-free topology coexist [19]. Thus use of single graph for modeling them has not been efficient. Here we propose the graph pyramid approach, where multiple graph features are used at different levels for modeling protein families. Along with this, the proposed algorithm using hierarchical voting scheme, tries to blend important characteristics from the PPI network and ISS methods for protein classification. This makes it possible to more objectively and reasonably predict the protein functions with high accuracy.

This paper is organized as follows. In the section 'Methods', we present the PPS network construction approach and its modeling via graph pyramid. The same section also discusses the important graph topological or graph structured features and the hierarchical protein classification algorithm. Experimental evaluation results of the proposed method, their comparison with existing prediction methods and the techniques of searching for the optimal algorithm parameters are presented in section 'Results'. We conclude our work with discussions about related issues and the direction of our future work.

## Methods

*s*

_{1}and

*s*

_{2}is defined as follows,

*H*(

*·*) is the Heaviside-step function,

The performance comparison given in the section 'Results', shows importance of the EB-score over the Bitscore.

### Graph construction

The proposed algorithm uses the graphical modeling of protein sequences from each protein family/class. Consider the large protein database having *M* classes. Let the set of class labels be given as ${\u2102}_{M}=\left\{{c}_{1},\phantom{\rule{2.77695pt}{0ex}}{c}_{2},\cdots \phantom{\rule{0.5em}{0ex}},{c}_{M}\right\}$. Consider one of the protein classes, $c\in {\u2102}_{M}$, then let ${s}_{{t}_{i}}^{c}$ be the *i*^{ th } training sequence in that class. Similarly ${s}_{q}^{{c}_{q}}$ is the new query or test sequence and its class label *c*_{ q } is what we have to find.

*c*has

*N*training sequences (

*N*may be different for different $c\in {\u2102}_{M}$), then the set of vertices for class

*c*is defined in the similarity space as, ${V}^{c}=\left\{{s}_{{t}_{1}}^{c},{s}_{{t}_{2}}^{c},\cdots {s}_{{t}_{N}}^{c}\right\}$. Strength of an edge between the vertices and is given as,

These edges form a set ${E}^{c}=\left\{{e}_{1,1}^{c},{e}_{1,2}^{e},\cdots \phantom{\rule{0.3em}{0ex}},{e}_{N,N}^{c}\right\}$. Now the graph of a protein class $c\in {\u2102}_{M}$ is given by *G*(*V*^{ c }*, E*^{ c }). This is a weighted and an undirected graph. An edge weight is nothing but the strength of protein sequence similarity.

To construct the graph of each protein class, we just need to consider interaction (EB-score) among all protein sequences within that class. Number of proteins in a class is far smaller than that of the entire database. So graphs of all protein classes can be easily and independently constructed by using protein-protein BLAST within the corresponding classes.

### Graph analysis

In protein similarity graphs, modularity, local clustering and scale-free topology [19] coexist. To explain this phenomenon we need the hierarchy, so graphs are analyzed in the hierarchical manner. At each hierarchical level, the edges with weights lower than a certain threshold are pruned. Now surviving edges are considered to be weightless. So the graph structure changes along hierarchical levels, as well as the graph becomes unweighted and remains undirected. This hierarchical analysis helps to extract different graph features for weakly similar hits (sequence matches) and thus captures the complex relationship between sequence similarity and protein function.

*i*as an indicator variable, and let ∅ be the null (empty) set, ∅ = {} then 'set element' is formed as

*c*, at certain hierarchy (i.e. at threshold

*t*), the edge set is given as,

The corresponding graph is given as $G\left({V}^{c},{E}_{t}^{c}\right)$. For notation simplicity lets represent it as *G*(*V*^{ c }*, E*^{ c }*, t*), instead of $G\left({V}^{c},{E}_{t}^{c}\right)$ and note that *G*(*V*^{ c }*, E*^{ c }) = *G*(*V*^{ c }*, E*^{ c }, 0).

and note that $|{\mathbb{S}}_{1}\uplus {\mathbb{S}}_{2}|=|{\mathbb{S}}_{1}+{\mathbb{S}}_{2}|$, thus added set contains repetitive elements when ${\mathbb{S}}_{1}\cap {\mathbb{S}}_{2}\ne \mathrm{0\u0338}$. For example, let ${\mathbb{S}}_{1}=\left\{{c}_{1},{c}_{2}\right\}$ and ${\mathbb{S}}_{2}=\left\{{c}_{2},{c}_{3}\right\}$ then ${\mathbb{S}}_{1}\uplus {\mathbb{S}}_{2}=\left\{{c}_{1},{c}_{2},{c}_{3},{c}_{2}\right\}$. This operation obeys the associative and the commutative laws like numerical addition. As defined earlier, ${s}_{q}^{{c}_{q}}$ is the query sequence from the unknown class *c*_{ q }. Now ${V}_{q}^{c}={V}^{c}\uplus {s}_{q}^{{c}_{q}}$, and edges among the vertices in the set is given by an edge set ${E}_{q}^{c}$. After adding ${s}^{{c}_{q}}$ to the original graph *G*(*V*^{ c }*, E*^{ c }), we will get the new graph $G\left({V}_{q}^{c},{E}_{q}^{c}\right)$.

### Graph Structured Features (GSF)

Most of the real world and biological (scale-free) networks communicate via a few highly connected nodes known as Hubs. These hubs determine the properties of networks [19]. In real world networks like airline route maps, the important cities form hubs. Proteins with high degrees of connectedness are more likely to be essential for survival than proteins with lesser degrees [22]. Gene duplication leads to growth and preferential attachment in biological networks [23]. This leads to translating the proteins having high similarity. This shows the possibility of hub formation in the protein family graphs, *G*(*V*^{ c }*, E*^{ c }), in the similarity space.

Figure 2(b) shows building of the PPS network with a varying threshold for one of the COG [6] protein families. We can see that as the threshold is lowered, trivially more edges are formed but most of them are associated with only particular nodes (hubs). Thus hubs are getting stronger and becoming more evident in the PPS network. We are not interested in the detailed assessment of whether the network is scale-free (a power-law degree distribution [19]) or not. But the above analysis helps to guide us for finding proper features which take graph structure (i.e. complex relationships among the protein sequences) into account. Also, the different protein families have different characteristics. Thus use of a single graph feature may not be effective. Features are selected such that they could extract different but vital network information.

#### Average Clustering coefficient (AC)

*n*, the clustering coefficient

*C*

_{ n }, measures the extent to which neighbors of

*n*are also the neighbors of each other [19]. Thus it is nothing but the density of sub-graph induced by the neighborhood of

*n*. Consider the graph

*G*(

*V, E*) with

*n*∈

*V*. Let ℕ

_{ n }be the number of neighbors of

*n*and ${\mathbb{E}}_{n}$ be the number of edges between them, then the

*AC*is given by,

*C*

_{ n }quantifies how close the neighbors of a node are, to form a clique among themselves. It represents the potential modularity of a network and

*C*

_{ n }of the most real networks is much larger than that of a random networks.

*AC*distribution is found to be effective for an identification of a modular organization of the metabolic networks [24]. Consider the example shown in Figure 3(a). Node

*c*has 4 neighbors $\left({\mathbb{N}}_{c}\right)$, having 2 connected edges $\left({\mathbb{E}}_{c}\right)$ among them (

*a*to

*b*and

*d*to

*e*), which forms ${C}_{c}=\frac{1}{3}$ and then $AC=\frac{13}{15}$. When ${s}_{q}^{{c}_{q}}$ is attached to

*G*(

*V*

^{ c }

*, E*

^{ c }), it may change its

*AC*. For a given the change in

*AC*is given as,

#### Rich Club coefficient (RC)

*d*) of a node is the number of directly connected neighbors. High degree nodes (rich nodes) are much more likely to form tight and well interconnected sub-graphs than low degree nodes [25]. Thus hubs are generated through 'rich-gets-richer' mechanism. A quantitative definition of the rich-club phenomenon is given by the rich-club coefficient (

*φ*). Let ${\mathbb{N}}_{d>r}$ be the number of vertices having degree greater than

*r*and ${\mathbb{E}}_{d>r}$ be the number of edges among those vertices then,

*φ*is a novel probe for finding topological correlations and it yields vital information about the underlying architecture of the network [25]. Similarly as explained earlier, the change in

*RC*is given as,

#### Star Motifs (SM)

*star-motifs*). Let power (

*p*) of

*SM*be the degree of the central (center of the 'star' pattern) node. Figure 3(b) shows the

*SM*with various powers. Each node in the training graph is already assigned with the node degree, so that the

*SM*can be easily computed. This simple feature answers the questions like, 'does the ${s}_{q}^{{c}_{q}}$ give rise to the new hubs' and 'what is the increased strength of the hubs'. Let

*SM*(

*·, p*) finds the number of

*SM*of power

*p*then change in SM is given as,

#### Triangles (TR)

*G*(

*V*

^{ c }

*, E*

^{ c }) be represented by

*N × N*adjacency matrix [

*E*

^{ c }], whose (

*i, j*)

^{ th }entry is given as, $\left[{E}^{c}\right]\left(i,\phantom{\rule{0.5em}{0ex}}j\right)=H\left({e}_{i,j}^{c}\right)$, then the number of triangles in the graph are given as,

Either the graph is dense or sparse, TR can be computed readily within the same time as the computation is only associated with the matrix of the same size. TR inherently captures different network properties than SM. Figure 3(c) illustrates this difference more elaborately. Query node *q* interacts with the nodes *a, b, c* and *d*. So they constitute an 'interacting neighborhood' to the query. TR has capability to simultaneously assess the interactions within interacting neighborhood. After the query interaction, one extra triangle is formed since only the nodes *b* and *c* were previously interacting. Whereas at node *a SM* power has increased from 3 to 4. Formation of new triangles in a graph indicates the fact that 'query interacts simultaneously to the already interacting nodes'. Newly formed number of triangles due to query interaction Δ*TR*(*c, t*), are found similarly as equation (8).

#### Graph Energy (GE)

*q*

_{1}interacts with a graph then its spread remains almost unaffected but in case of

*q*

_{2}interaction, the spread of a graph alters drastically.

*GE*is defined as the sum of the absolute values of the eigenvalues of the adjacency matrix [26], and given as follows,

Since *GE* depends only on the adjacency matrix, the density of the graph does not affect its computation time. The effect of query interaction on the original graph structure is captured by change in *GE* (i.e. Δ*GE*(*c, t*)), given similarly like equation (8). We are dealing with graphs whose edge strength is the similarity between connecting nodes, which is inverse of the usual edge length definition. So we need to look for the maximum Δ*GE*(*c, t*).

### Algorithm

Graphs are analyzed hierarchically (as discussed in section 'Graph analysis') and threshold plays an important role in making hierarchical graph structure. If the query can interact at the higher layer of GP (see Figure 2(a)), then it means it is a strong interaction and it accounts for the global feature. Because in GP as the level rises, the threshold also increases and at every level, the graph edges can only be formed if their strength is greater than the given threshold. Here interactions are in the sequence similarity space, so a sstrong interaction means the highest similarity between corresponding sequences, which occurs when both sequences match at most of the nucleic acids (i.e. match globally). Hence strong interaction accounts for the global feature and similarly weak interactions account for local features.

*t*

_{ AC }= {

*t*

_{1}

*, t*

_{2}

*, t*

_{3}} and

*t*

_{1}

*< t*

_{2}

*< t*

_{3}. Let us consider there are only 3 protein classes i.e. $\left|{\u2102}_{M}\right|=3$. Figure 4 explains the hierarchical query classification subroutine (algorithm 1) for the feature

*AC*. Each

*q*

_{ i }is analyzed first at the highest level (

*t*

_{3}) where we look for class $c\in {\u2102}_{M}$, having Δ

*AC*(

*c, t*)

*> T*

_{ AC }and collect them in ${\u2102}_{AC}\subseteq {\u2102}_{M}$. For query

*q*

_{1}we can not find any such classes

*c*at

*t*

_{3}, so we descend the GP to

*t*

_{2}and discover ${\u2102}_{AC}=\left\{{c}_{2},{c}_{3}\right\}$ with threshold

*t*

^{ ∗ }=

*t*

^{2}. The secondary threshold (

*T*

_{ AC }) is necessary, otherwise there will be many spurious classes i.e. false positives (FP), having nonzero change in average clustering coefficient $\left(\text{\Delta}AC\left(\cdot \right)\ne 0\right)$.

*t*

^{ ∗ }is the maximum threshold (also defines maximum GP level) at which the query starts interacting with the graph of some class. Let us represent the subroutine by abusing the notation for simplicity and readability as,

Maximum value of *H*(*·*) is 1, so all the arguments (classes *c*) are assigned to ${\u2102}_{AC}$ whenever it produces output 1. For reducing FP, the subroutine for *SM* and *TR* slightly changes (see algorithm 2). Here we look for *k* maximally influenced classes from ${\u2102}_{RC}$ by the query. Thus classes from only ${\u2102}_{RC}$ are assessed (voted) again by the features *SM* and *TR*. Subroutine for *GE* finds the class from ${\u2102}_{SM}\cup {\u2102}_{TR}$ for which Δ*GE*(*·*) is maximum. Thus this produces a hierarchical class voting scheme which helps to improve the classification accuracy and to reduce the computational load.

Each GSF has an ability to extract different information from different levels of the protein family GP. However, applying each GSF to entire GP, is computationally inefficient when dealing with large numbers of protein families. In addition, it may add up the FP, when a decision is being made in the much lower GP level than the level defined by *t*^{ ∗ }. To avoid these problems, the GP based hierarchical voting scheme is necessary. And the rational behind placing different GSF at different GP levels, is explained in the next 'Results' section.

**Algorithm 1** Graph pyramid search subroutine

input: ${s}_{q}^{{c}_{q}}$; secondary threshold *T*_{ AC }; primary threshold ${t}_{AC}=\left\{{t}_{1},{t}_{2},\cdots \phantom{\rule{0.3em}{0ex}},{t}_{n}\right\}$, where *t*_{ i } >*t*_{ j } for *i* >*j*

**output:** ${\u2102}_{AC},{t}^{*}$

1: ${\u2102}_{AC}=\varnothing $

2: **for** *t* ∈ *t*_{ AC } from *t*_{ n } to *t*_{1} **do**

3: **if** ${\u2102}_{AC}=\varnothing $ **then**

4: **for all** classes $c\in {\u2102}_{M}$**do**

5: *I*_{ AC } = *H* (Δ*AC*(*c,t*)−(*T*_{ AC }))

6: ${\u2102}_{AC}={\u2102}_{AC}\uplus \delta \left(c,{I}_{AC}\right)$

7: *t** = *t*

8: **end for**

9: **end if**

10: **end for**

## Results

### Dataset and evaluation details

Proposed method is evaluated on entire COG database [6]. It is the protein database of Clusters of Orthologous Groups (COG). It consists of 4,873 COG (protein families), having total 138,458 proteins from 66 different genomes. Approximately 10% sequences from each COG, are selected randomly, which has produced 14,086 test sequences. This procedure is repeated 5 times further to get average performance. First, each GSF is tested independently, for various thresholds without using hierarchical voting scheme. Here, the class which produces maximum change in the GSF for a given ${s}_{q}^{{c}_{q}}$, is selected as the output. These output labels are produced with either correct decision (*cd*), wrong decision (*wd*) or no decision (*nd*, when $\left|{c}_{q}\right|\ne 1$). Then let the performance measure be defined as, $precision=\frac{cd}{cd+wd}$.

### Rational behind hierarchical voting

*AC*and

*RC*produce high precision as the threshold rises, so these GSF are appointed to work at higher levels of GP. So at a high threshold, it is more likely that ${\u2102}_{AC}$ and ${\u2102}_{RC}$ contain true output class. Thus it is sufficient to apply other GSF, to the GP generated from either ${\u2102}_{AC}$ or ${\u2102}_{RC}$. On the other hand,

*GE*produces high precision for low thresholds. One of the possible reasons behind this is that, the higher the threshold, the sparser will be the graph. So eigen-decomposition of the adjacency matrix to calculate

*GE*will not give any information as Δ

*GE*is close to zero for all classes. While at low threshold, the original graph becomes dense and query also interacts with almost all nodes in the true output class graph. Immensity in the interaction at lower threshold, helps

*GE*to detect the true class easily and correctly. This forces

*GE*to work at lower levels of GP, with the smallest search space as ${\u2102}_{SM}\cup {\u2102}_{TR}$. With similar arguments,

*SM*and

*T R*are placed at intermediate GP levels, allowing them to look for

*c*

_{ q }in ${\u2102}_{RC}$. So in the algorithm 2, hierarchy as well as input search space for GSF are organized carefully. This helps to reduce the search space dramatically for other GSF and thus speeds up the algorithm (Figure 6 for speed comparison).

**Algorithm 2** Classification by hierarchical voting

training: all G(V^{c},E^{c}) are constructed $\forall c\in {\u2102}_{M}$

input: ${s}_{q}^{{c}_{q}},r,p,k$, primary threshold set $\phantom{\rule{0.5em}{0ex}}\mathbb{T}$, secondary thresholds *T*_{ AC }, *T*_{ RC }

**output:** *c* _{ q }

1: ${\u2102}_{AC}\leftarrow \underset{c\in {\u2102}_{M}}{\text{argmax}}\phantom{\rule{0.5em}{0ex}}H\left(\text{\Delta}AC\left(c,{t}^{*}\right)-{T}_{AC}\right)$

2:${\u2102}_{RC}\leftarrow \underset{c\in {\u2102}_{AC}}{\text{argmax}}\phantom{\rule{0.5em}{0ex}}H\left(\text{\Delta}RC\left(c,{t}^{*},r\right)-{T}_{RC}\right)$

3: ${\u2102}_{SM}\leftarrow \underset{c\in {\u2102}_{RC}}{\text{argk-max}}\text{\Delta}SM\left(c,{t}^{*},p\right)$

4: ${\u2102}_{TR}\leftarrow \underset{c\in {\u2102}_{RC}}{\text{argk-max}}\text{\Delta}TR\left(c,{t}^{*}\right)$

5: ${\u2102}_{GE}\leftarrow \underset{c\in {\u2102}_{SM}\cup {\u2102}_{TR}}{\text{argk-max}}\text{\Delta}GE\left(c,{t}^{*}\right)$

6: \∗ *get the class label having the highest frequency* ∗\

7: *ψ*_{ q } = mode $\left({\u2102}_{AC}\uplus {\u2102}_{RC}\uplus {\u2102}_{SM}\uplus {\u2102}_{TR}\uplus {\u2102}_{GE}\right)$

8: \∗ *resolve the indecisive case step by step* ∗\

9: **if** *|ψ*_{ q }*| ≥* 2 **then**

10: ${\u2102}_{SM}\leftarrow \underset{c\in {\u2102}_{RC}}{\text{argmax}}\text{\Delta}SM\left(c,{t}^{*}\right)$

11: ${\u2102}_{TR}\leftarrow \underset{c\in {\u2102}_{RC}}{\text{argmax}}\text{\Delta}TR\left(c,{t}^{*}\right)$

12: ${\psi}_{q}^{\prime}=\text{mode(}{\u2102}_{SM}\uplus {\u2102}_{TR}\uplus {\u2102}_{GE}\text{)}$

13: **if** ${\psi}_{q}^{\prime}\ge 2$ **then**

14: ${c}_{q}={\u2102}_{GE}$

15: **else**

16: ${c}_{q}={\psi}_{q}^{\prime}$

17: **end if**

18: **else**

19: *c*_{ q } = *ψ*_{ q }

20: **end if**

Sometimes, for the query ${s}_{q}^{{c}_{q}}$, having subtle interactions with many classes, it is difficult for all GSF to come up with an unique agreement about *c*_{ q } . When it happens, the threshold would have already hit the bottom of its range. Thus, with earlier reasoning, the solution would be to rely only on *GE* to find *c*_{ q } , and 14^{ th } step in the algorithm 2 does the same.

### Deciding algorithmic parameters

Figure 5(b) shows the precision Vs threshold plots for *SM* and *RC* with different parameters. This helps to decide optimal parameters (*p*^{ ∗ }*, r*^{ ∗ }) for them at the particular threshold. In the implementation, *p*^{ ∗ }= 2 for all GP levels, while *r*^{ ∗ } is set 3 for lower and 5 for higher GP levels. Other thresholds are set using the validation set by analyzing the maximum values for each GSF. And each set in the$\phantom{\rule{0.5em}{0ex}}\mathbb{T}$ has the uniformly quantized numbers from 0 to maximum GSF value.

### Performance analysis

Figure 6 shows the normalized time taken by different classifiers for testing 14,086 sequences. In Majority voting scheme, first all GSF classify each sequence from the large pool of testing sequences, and then the voting begins. This slows down the scheme. On the other hand, in the proposed GP hierarchical scheme, the testing pool is gradually shrunken down. So the subsequent GSF have to investigate only small set of sequences, which likely to contain the true protein class. Which in turn speeds up the proposed algorithm along with maintaining high accuracy.

*c*

_{ q }, like replacing

*G*(

*V*

^{ c }

^{ q }

*, E*

^{ c }

^{ q }) with $G\left({V}_{q}^{{c}_{q}},{E}_{q}^{{c}_{q}}\right)$. Experiment consists of randomly selecting various (10 to 90) percent data from each $c\in {\u2102}_{M}$ for training purpose. This procedure is repeated 5 times and the Figure 7(b) shows the average classification performance comparison between incremental and batch learning. For small amounts of training data, batch learning performs poorly. On the other hand, incremental learning takes advantage of each correctly classified ${s}_{q}^{{c}_{q}}$ and produces better performance even during the scarcity of the training data.

*mean*bit score' classification method, bit score is used as an edge weight for constructing the graph. The class, $c\in {\u2102}_{M}$, which produces the maximum mean of the weights of newly formed edges by ${s}_{q}^{{c}_{q}}$, is decided as

*c*

_{ q }. The performance of this type of bit score based methods, is poorer than EB-score based methods. Top part of the Table 1, shows the importance of the EB-score and the GP; and bottom part of it compares the performance of the proposed method with various methods. When the GSF are not used hierarchically with the GP, they fail to extract enough information from protein family for classification. Thus the accuracy of 'TR without GP' is only 90%, while that of 'TR with GP hierarchy' is 98.9%. The proposed majority voting scheme without hierarchy (No Hie), shows better accuracy than the Tree-kNN based state of the art method [27], while GP based hierarchical voting (GP Hie) scheme produces the best accuracy. Being twice faster than 'No Hie', with maintaining high performance, the 'GP Hie' method is the preferable solution for a time consuming protein classification task.

Average number of protein sequences misclassified (out of 14,086 testing sequences from COG [6] database) by the different protein classification methods.

| 362.3 |
| 263.2 |
---|---|---|---|

| 587.5 |
| 238.1 |

| 970.0 |
| 308.4 |

| 1404 |
| 150.7 |

KNN classifier | 309.7 | ||

Highest scoring BLAST match [2] | 362.9 | ||

Boujenfa et al. (using ClustalW) [27] | 35.2 | ||

Proposed majority voting of GSF (No Hie) | 28.2 | ||

Proposed GP based hierarchical voting (GP Hie) | |

## Discussion and conclusions

As discussed initially in the background section, here we took an approach based on protein homology for protein function prediction. According to this approach an entire task boils down to protein classification, because two proteins with similar sequence or structure could evolve from a common ancestor and thus have similar functions. So once we classify a protein to its true family, we can easily ascertain its probable functions from the characteristics of its family. We took this approach because it is fast, an approximate and primary way to tackle a daunting task of function prediction of a large number of proteins.

This paper proposes a novel protein classification method based on PPS network modeling using the proposed EB-scores. It tries to blend important characteristics from PPI network and ISS methods for protein classification. Importance of the method is that it exploits the topological structural information of the PPS network, using hierarchical network analysis guided by the graph pyramid. This helps to analyze the different protein interactions at different pyramid levels. Thus the necessary information for protein classification from weak interactions in the PPS network is not suppressed by the other strong interactions. And proposed features extract the different network properties at various pyramid levels. This makes it possible to more objectively and reasonably predict the protein class.

The hierarchical voting algorithm helps to improve the computational efficiency with maintaining high classification accuracy. Some of the salient features of the proposed method are; protein sequences as the only input requirement; fast and easy incremental learning; can show topologically, how the query sequence interacts with the protein family; quick training and the high performance. The proposed graph based modeling, has an extra advantage that the relationship between protein families can also be found by finding the corresponding inter-graph similarities. The experimental evaluation on COG database demonstrated the effectiveness of the proposed method.

This graph pyramid approach is also promising to use in the PPI network and various other graph based bioinformatics methods. Protein characteristics like 3D structure and presence of various domains, along with sequence similarity measure can be used for more efficient protein network construction. Our future work will try to address these issues.

## Notes

### Acknowledgements

Publication of this article has been funded by Next-Generation Information Computing Development Program through the National Research Foundation of South Korea (NRF), funded by the Ministry of Science, ICT and Future Planning (No.NRF-2012M3C4A7033341). It was also partially sponsored by BK 21 Plus program.

This article has been published as part of *BMC Medical Genomics* Volume 8 Supplement 2, 2015: Selected articles from the 4th Translational Bioinformatics Conference and the 8th International Conference on Systems Biology (TBC/ISB 2014). The full contents of the supplement are available online at http://www.biomedcentral.com/bmcmedgenomics/supplements/8/S2.

### References

- 1.Needleman SB, Wunsch CD: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology. 1970, 48: 443-453. 10.1016/0022-2836(70)90057-4.CrossRefPubMedGoogle Scholar
- 2.Altschul SF, Gish W, Miller W, Myers EW, J LD: Basic local alignment search tool. Journal of Molecular Biology. 1990Google Scholar
- 3.Sandhan T, Sonowal S, Choi JY: Audio bank: A high-level acoustic signal representation for audio event recognition. Int Conf on Control, Automation and Systems (ICCAS). 2014, IEEEGoogle Scholar
- 4.Sandhan T, Choi JY: Sandhan, t and yoo, y and yoo, h and yun, s and byeon, m. Int Conf on Advanced Video and Signal-Based Surveillance (AVSS). 2014, IEEEGoogle Scholar
- 5.Sandhan T, Choi JY: Frequencygrams and multi-feature joint sparse representation for action and gesture recognition. Int Conf on Image Processing (ICIP). 2014, IEEEGoogle Scholar
- 6.Tatusov RL, Natale DA, Garkavtsev IV, Tatusova TA, Shankavaram UT, Rao BS, Kiryutin B, Galperin MY, Fedorova ND, Koonin EV: The cog database: new developments in phylogenetic classification of proteins from complete genomes. Nucleic Acids Research. 2001Google Scholar
- 7.Yi TM, Lander E: Recognition of related proteins by iterative template refinement (itr). Protein Sci. 1994, 3: 1315-1328. 10.1002/pro.5560030818.CrossRefPubMedPubMedCentralGoogle Scholar
- 8.Luthy R, Xenarios I, Bucher P: Improving the sensitivity of the sequence of the sequence profile method. Protein Sci. 1994Google Scholar
- 9.Henikoff S: Scores for sequence searches and alignments. Current Opinion in Structural Biology. 1996, 353-360.Google Scholar
- 10.Wheeler D: Selecting the right protein-scoring matrix. Curr Protoc Bioinformatics. 2002Google Scholar
- 11.Sandhan T, Srivastava T, Sethi A, Choi JY: Unsupervised learning approach for abnormal event detection in surveillance video by revealing infrequent patterns. Int Conf on Image and Vision Computing New Zealand (IVCNZ). 2013, IEEEGoogle Scholar
- 12.Sandhan T, Chang HJ, Choi JY: Abstracted radon profiles for fingerprint recognition. Int Conf on Image Processing (ICIP). 2013, IEEEGoogle Scholar
- 13.Soding J: Protein homology detection by hmm-hmm comparison. Bioinformatics. 2005Google Scholar
- 14.Pellegrini M, Marcotte E, Thompson M, Eisenberg D, Yeates T: Assigning protein functions by comparative genome analysis: protein phylogenetic profiles. Proc Natl Acad Sci USA. 1999Google Scholar
- 15.Enright A, Iliopoulos I, Kyrpides N, Ouzounis C: Protein interaction maps for complete genomes based on gene fusion events. Nature. 1999Google Scholar
- 16.John B, Sali A: Detection of homologous proteins by an intermediate sequence search. Protein Sci. 2004, 54-62.Google Scholar
- 17.Park J, Teichmann SA, Hubbard T, Chothia C: Intermediate sequences increase the detection of homology between sequences. J Mol Biol. 1997Google Scholar
- 18.Kim S, Lee J: Bag: a graph theoretic sequence clustering algorithm. Int J Data Min Bioinformatics. 2006Google Scholar
- 19.Barabasi AL, Oltvai ZN: Network biology: understanding the cell's functional organization. Nature Reviews Genetics. 2004Google Scholar
- 20.Chua HN, Wong L: Predicting protein functions from protein interaction networks. Bio Data Mining in Proein Int Net. 2009Google Scholar
- 21.Schwikowski B, Uetz P, Fields S: A network of protein-protein interactions in yeast. Nature Biotech. 2000, 1257-1261.Google Scholar
- 22.Jeong H, Mason SP, Barabasi AL, Oltvai ZN: Lethality and centrality in protein networks. Nature. 2001, 411-412.Google Scholar
- 23.Bhan A, Galas DJ, Dewey TG: A duplication growth model of gene expression networks. Bioinformatics. 2002Google Scholar
- 24.Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabasi AL: Hierarchical organization of modularity in metabolic networks. Science. 2002Google Scholar
- 25.Colizza V, Flammini A, Serrano MA, Vespignani A: Detecting richclub ordering in complex networks. Nature Physics. 2006Google Scholar
- 26.Gutman I: The energy of a graph. Steiermarkisches Mathematisches Symposium. 1978, 100-105.Google Scholar
- 27.Boujenfa K, Essoussi N, Limam M: Tree-knn: A tree-based algorithm for protein sequence classification. Int Journal on Comp Sci and Engineering (IJCSE). 2011Google Scholar

## Copyright information

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.