Skip to main content

MimoPro: a more efficient Web-based tool for epitope prediction using phage display libraries



A B-cell epitope is a group of residues on the surface of an antigen which stimulates humoral responses. Locating these epitopes on antigens is important for the purpose of effective vaccine design. In recent years, mapping affinity-selected peptides screened from a random phage display library to the native epitope has become popular in epitope prediction. These peptides, also known as mimotopes, share the similar structure and function with the corresponding native epitopes. Great effort has been made in using this similarity between such mimotopes and native epitopes in prediction, which has resulted in better outcomes than statistics-based methods can. However, it cannot maintain a high degree of satisfaction in various circumstances.


In this study, we propose a new method that maps a group of mimotopes back to a source antigen so as to locate the interacting epitope on the antigen. The core of this method is a searching algorithm that is incorporated with both dynamic programming (DP) and branch and bound (BB) optimization and operated on a series of overlapping patches on the surface of a protein. These patches are then transformed to a number of graphs using an adaptable distance threshold (ADT) regulated by an appropriate compactness factor (CF), a novel parameter proposed in this study. Compared with both Pep-3D-Search and PepSurf, two leading graph-based search tools, on average from the results of 18 test cases, MimoPro, the Web-based implementation of our proposed method, performed better in sensitivity, precision, and Matthews correlation coefficient (MCC) than both did in epitope prediction. In addition, MimoPro is significantly faster than both Pep-3D-Search and PepSurf in processing.


Our search algorithm designed for processing well constructed graphs using an ADT regulated by CF is more sensitive and significantly faster than other graph-based approaches in epitope prediction. MimoPro is a viable alternative to both PepSurf and Pep-3D-Search for epitope prediction in the same kind, and freely accessible through the MimoPro server located at


In humoral immunity, a pathogenic antigen is recognized by an antibody or B-cell receptor (BCR) through some regions on the outer surface of the antigen that are commonly known as the B-cell epitope. Since humoral responses are induced by epitopes on the surface of an antigen, rather than the whole antigen, it is important to locate these epitopes for the purpose of effective vaccine design. The most reliable methods for identification of epitopes are X-ray crystallography and NMR techniques, but they are time-consuming and expensive. Although using computational methods to predict epitopes is faster and cheaper, people still hold some doubts on the reliability of such techniques, compared with those experimental methods. Therefore incorporating experimental and computational methods in epitope prediction, such that epitope candidates are selected by computational methods prior to laboratory experiments, can lead to both significantly reducing the experimental cost and substantially accelerating the process of identification.

A continuous B-cell epitope is composed of residues in a single sequence of peptides whereas a discontinuous B-cell is constituted of multiple segments of amino acids. It has been reported that more than 90% of B-cell epitopes are discontinuous B-cell epitopes [1]. Early computational methods for epitope prediction were mostly focused on finding linear B-cell epitopes using different propensity scales and epitopic motifs which are derived from peptide sequences [26].

Theoretically, the 3D structure of a protein can provide more information than the amino acid sequence can. Therefore a good understanding of such 3D structure should lead to significant improvement in epitope prediction. CEP proposed in 2005 [7] and DiscoTope proposed in 2006 [8] are good examples of using such 3D information in epitope prediction. Recently proposed methods [9, 10] have demonstrated further improvement on the performance in epitope prediction. Despite these achievements, epitope prediction is still a challenging task because epitopes are context dependent [11]. This means that the surface of an antigen is full of potential epitopes but the active epitopes depend on the antibody binding to the antigen in certain interactions.

Predicting B-cell epitopes using a phage display library takes the following procedure in general. Firstly, random peptides are displayed on the surface of filamentous phages. These random peptides which bind to a monoclonal antibody with a certain degree of affinity are then screened and amplified. This process is repeated, and with increase in number of iterations the resultant peptides become fewer but with a higher affinity. These affinity-selected peptides are also called mimotopes that have the similar functionality to and a high sequential similarity with the native epitope [12, 13]. These features imply that certain key binding motifs and physicochemical preferences exist during interactions. Because mimotopes derived from the phage display technique share a common motif, mapping these mimotopes back to the source antigen can help finding the genuine epitope more accurately.

In recent years, trials have been made on mimotope mapping and several software packages have been developed accordingly. These tools can be classified into two major categories. One is to map mimotopes to the overlapping patches on the surface of an antigen using statistical features of mimotopes, such as physicochemical properties. Examples of this category include MIMOX [14], 3DEX [15], SiteLight [16], and Mapitope [17]. The other is to map mimotopes back to the genuine epitopes through aligning methods, such as FINDMAP [18], PepSurf [19], and Pep-3D-Search [20].

Mimotope mapping was firstly formulated as a graph searching problem by Mayrose et al. [19], and its objective was to find a group of simple paths on a graph generated from the residues on the surface of an antigen with the best match to the query mimotopes. It has been proven that finding a simple path on a graph is a NP-complete problem [18, 21]. To make this intensive computation relatively efficient, PepSurf utilized a stochastic-based color-coding method [22] whereas Pep-3D-Search adopted an ant colony optimization (ACO) algorithm [23].

Finding a simple path on a graph is computationally intractable for any large-scale searching problem, but satisfactory performance can be achieved if the problem is kept in a small search space. In this paper, we propose a patch-based graph searching method that searches through all nodes on a regulated graph that has a confined small number of nodes. On each single patch, a complete search is conducted to guarantee the best alignment for each mimotope sequence. Dynamic programming (DP) [24] and branch & bound (BB) [25] method are also adopted to both avoid repetition in searching and further narrow the search space during processing. Furthermore, compared with previous work, we introduce an ADT to delineate a small area so that all amino acids within that area are regarded as the neighbor amino acids. This ADT is determined by a compactness factor (CF) which is modified from clustering coefficient firstly proposed in [9]. Adoption of such an ADT should better reflect the structural differences of various antigen surfaces. The results from a validation data set have confirmed that our method is more sensitive and faster in epitope prediction.

Our algorithm has been implemented as a Web-based tool named as MimoPro (Mimotope Projection) for public access, through which users around the world are able to carry out further validation and new applications. The MimoPro server is located at

Methods and Implementation

Overview of the proposed method

Our method aims at mapping a number of mimotopes back to the surface of an antigen so as to locate the interacting epitope on the antigen. Therefore, the required input includes both the X-ray crystal structure of a source antigen stored in a protein data bank (PDB) [26] and mimotopes screened from phage display experiments. The output of this mapping is a candidate epitope through the paths aligned to corresponding mimotopes.

Initially, the antigen surface is divided into some overlapping patches with a radius of 15 Å and each patch is centered at atom C β of a surface residue. Secondly, surface patches are further transformed to graphs bounded by neighboring amino acids that are determined using an ADT adjusted by CF. Mapping then becomes finding the best matched path for each mimotope in each graph. Since paths may have different lengths, to assess the similarity between a path and a mimotope sequence and to give consensus scores to paths with different lengths, we employ a statistical scoring norm called P-value that is derived from the extreme value distribution (EVD) for each mimotope [19]. Afterwards a patch-based searching algorithm is utilized to find the best alignment for each mimotope sequence in each graph. The similarity between a path and the corresponding mimotope is rated by P-value, and the patch with the highest score is retained as a potential candidate for the native epitope. This process is illustrated in Figure 1.

Figure 1
figure 1

Basic process of MimoPro. Blocks on the right denote both the start of a request submitted by a user and the end of a request when the processed results are sent to the user by the specified email. The middle part is the flowchart of MimoPro process, which consists of six sequential functional blocks. Blocks on the left denote external services, with which MimoPro interacts during processing.

Generation of surface patches

Since an epitope is a cluster of residues distributed on the surface of an antigen, the surface residues are firstly extracted from an antigen structure using solvent exposure [27]. Solvent exposure is commonly measured by solvent accessible surface area (ASA) which was firstly defined by Lee & Richards [28]. ASA of a residue is calculated as the sum of exposed areas of atoms using a 'rolling ball' algorithm developed by Shrake & Rupley [29]. This algorithm has been implemented by different researchers for academic use [30, 31]. We choose Surface Racer 4.0 [31] to calculate ASA using a probe with a radius of 1.4 Å.

Similar to prior studies, we use relative solvent accessibility (RSA) of a residue as the surface residue. RSA of a residue is defined as ASA of a residue in proportion to the maximum exposed area of the same type. The maximum exposed area is measured as the exposed area of any type of amino acid in an ALA-X-ALA tripeptide [32]. In this study, ASA of each residue is firstly calculated with a probe radius of 1.4 Å; the sum of ASA of all member atoms is then calculated automatically; finally, any residue with RSA larger than a predefined threshold of 0.05 Å2 is determined as a surface residue.

We choose a patch with a radius of 15 Å so that most epitopes can be encompassed in such a patch [33]. Because most patches contain no more than 50 residues, and most epitopes are distributed in loose and/or protruding regions of an antigen surface [8], patches containing more than 50 residues are precluded from consideration. To determine if a residue falls into a patch, position of the residue must be specified first. Commonly, a residue can be positioned at C α , C β or AHA atom of an amino acid [20]. Since an antigen interacts with corresponding antibody through the side chain, we think that the distance between two C β atoms may better represent the spatial closeness of two neighboring residues.

Compactness factor and generation of graphs

In graph theory, a graph is defined as G= (V, E) where V denotes a collection of vertices and E denotes a collection of edges between any two vertices. To generate a graph from a surface patch, each residue on the surface patch is regarded as a vertex and the connection between a pair of vertices that is smaller than a predefined distance threshold is considered to be an edge. This has been realized using a fixed distance threshold (FDT) in all previous studies reported so far. The drawback of using an FDT is that the selection of a proper distance threshold is both difficult and irrational to some extent. This is mainly because different proteins have different structures, and even a single protein contains many different regions. Logically these different regions vary largely in spatial compactness. Therefore, a rationalized distance threshold should be adjustable so that a longer distance is used in the loose regions of an antigen to include more useful connections whereas a shorter distance is adopted in the dense regions to preclude some insignificant connections.

In this study, we use an ADT that is changeable in different regions of an antigen so that all resultant graphs share a uniform compactness. To estimate the compactness of a graph, we introduce a new parameter named as compactness factor (CF) that is modified from the clustering coefficient proposed in [9]. The compactness of a graph with different number of vertices is estimated by the observed number of edges in proportion to the expected number of edges, which is formulated as:


where e denotes the observed number of edges under a specified distance threshold; a is an empirical constant set to 4; k is the number of vertices in the graph. The production of a×k is the expected number of edges.

Originally the expected number of edges is estimated by k(k - 1)/2, which is the maximum number of edges in a graph of k vertices [9]. With increase in number of vertices, the expected number of edges grows much faster than the observed number of edges does. Since each graph is transformed from a small patch that contains a limited number of residues (or vertices) and a residue only interacts with its neighbors in our problem, the expected number of edges is estimated to grow linearly with the number of vertices in the graph.

Figure 2 shows an example of graph generation guided by CF. Normalization of compactness for all graphs regulated by CF also makes searching simpler and faster compared with previous methods.

Figure 2
figure 2

Generation of a graph from a surface patch. Dots in the left circle in yellow are residues inside a surface patch. Generation of a graph starts at setting a default distance threshold of 6.5 Å. A graph can be generated from the surface patch by specifying the connection between pairs of vertices (residues) within the distance threshold. Such a graph is shown in the right circle where edges are colored in white. The CF value can be calculated from this graph. If the value is smaller (or greater) than the bottom (or top) bound of a pre-specified CF value, the distance threshold is increased (or decreased) by 0.01 and the corresponding graph is generated. New edges colored in red are added into the previous graph. This process can be repeated until the CF value falls into the specified range.

Mimotope mapping using dynamic programming

The patch-based complete search through dynamic programming (DP) [24] can be used to locate the active epitope on an antigen surface using a mimotope library. Since every mimotope may contain some information about the active epitope, all mimotopes are equally treated as query sequences and aligned to the best matched paths in each graph. Mapping a single mimotope sequence in a graph includes two tasks: scanning all potential paths in a graph, and assessing the similarity between each path and the mimotope sequence. A local alignment approach, including operations of replacement, insertion, deletion, and no-gap penalty at both ends of an alignment, is adopted to rank a path in a graph.

In every single alignment, a mimotope of length k is treated as a query denoted by Q(k) = (q1,...,q k ), where q i denotes the i th amino acid in the query sequence (mimotope). A graph can be treated as a collection of simple paths, and each path is represented by P(k) = (p1,...,p k ), where p i stands for the i th vertex (residue) in a graph. Further, we employ a substitution matrix to specify the penalty of replacement for a pair of amino acids: one being from a query sequence, and the other being aligned to the antigen surface. The score for the alignment between a path and a query sequence can be calculated by:


where W(Q(k), P(k)) denotes the score for the alignment between path P(k) and query mimotope sequence Q(k); h(q i , p i ) denotes the penalty for a vertex p i in path P(k) with respect to an amino acid q i in mimotope sequence Q(k).

Most mimotopes from the phage display experiments contain no more than 15 amino acids. Since the compactness of any graph is controlled by a CF of 0.73 ± 0.06 in this study and the size of each graph is restricted to 50 vertices at most, we can make sure that the searching space is small enough to perform a complete search efficiently. Theoretically the search algorithm should explore all the potential paths in a graph and identify the path that best matches the mimotope sequence. Dynamic programming (DP) can reduce the number of repeating searches and prune some insignificant paths encountered in the traditional search algorithm.

A query sequence Q(k) (mimotope) is divided into k shorter strings. Each string starts at the first amino acid and ends at the i th amino acid denoted as Q(i). During the processing, each query string Q(i) is aligned to a graph iteratively and incrementally. A simple path P(m, S) which matches the query string Q(i) is represented by the last vertex m it ends at and a set of visited vertices (S). Increment of path P(m, S) from the i th step to the (i+1)th step is achieved by adding either vertex j that connects to m or a gap, whichever having a smaller penalty. Paths that end at the same vertex and share the same set of visited vertices but with different permutations are repeated paths. Among these repeated paths, the path with the highest score is retained only and other paths are regarded less significant.

The DP process starts at scoring each vertex in a graph from the first amino acid of a mimotope query sequence, which is also the shortest query string. A path ending at the current vertex is created by adding the current vertex into S, and the score for this newly generated path takes the highest among the penalty for a gap, the penalty for a replacement, or zero. The score should not be below zero since we place no penalty at both ends of an alignment.

As a query grows from Q(i) to Q(i+1), a new path for Q(i+1) is generated through: 1) calculating the penalty for amino acid replacement; 2) comparing the penalty for the replacement with the penalty for a gap, and adding whichever the higher to the path at spot i; 3) a matched path for query string Q(i+1) being generated by appending vertex j (or gap if no vertex) to a matched path for Q(i) resulted from the i th step ending at vertex m (m and j are connected vertices). When the iteration finally ends at string Q(k), the best matched path in a graph for Q(k) is obtained by scanning the best alignments ended at each vertex. Such iteration should identity all possible paths that have the potential to be the best alignment for query Q(k).

The DP process can be summarized by the following recursion:


W[Q(i),P(j, S)] stands for the score of the alignment between the query string Q(i) and the matched path P(j, S); δ D denotes the penalty for a gap. Note that j could be any vertex that is connected to vertex m.

Application of the branch and bound method

The branch and bound (BB) method was initially proposed by Land [25] for the purpose of finding optimal solutions to various optimization problems, especially the discrete and combinatorial optimization problems. The objective of BB is to screen out a subset of candidate solutions by pruning a number of useless solutions. For a given candidate set S, a splitting procedure is utilized to divide S into some subsets. Another procedure is used to estimate the upper bound or lower bound of a candidate solution. The main idea of BB is to exclude those candidates whose upper bound is below the lower bound of other candidates during finding the maximum solution in S. Therefore, the essential task of BB is to define a proper estimator for measuring the lower and the upper bounds.

In our problem, we observed a sharp decrease in speed during DP processing when the query string reaches 10 amino acids. Therefore, we intend to apply BB to the set of candidate paths so as to optimize the candidate set by excluding some useless paths during the DP process.

Scoring for paths and patches

The best alignment to a mimotope sequence is obtained by repeatedly performing the DP procedure. However, the alignment score for a mimotope will be inaccurate if paths with different lengths are evaluated in the same way. Therefore, P-value that is generated from the EVD using the method described in [19] is used as the scoring mechanism. The score for a patch is calculated as the sum of P-value scores of all alignments associated with that patch. Patches with the highest score are retained as the possible candidate epitopes.

A modified BLOSUM62 substitution matrix

In bioinformatics and evolutionary biology, substitution matrices play a very important role in evaluating the homology of two amino acids. In our problem, mimotopes derived from a phage display library share a certain degree of homology with the epitopic region in most cases. Hence selection of substitution matrices has a great impact on the performance of alignment. Previously BLOSUM62 has been proven to be successful in detecting similarities in distance sequences, and used by default in some applications, such as BLAST [34]. Our study cannot satisfy the prerequisite of BLOSUM62 because a phage display library is biased in using four kinds of rib nucleotide, which has been discussed in [19]. However, the modified BLOSUM62 for NNK library can be used for our problem and thus is set as the default setting in our process.

Results and Discussion

A brief introduction to the MimoPro server

The MimoPro server is currently deployed on Linux using tomcat server 6.0. It has been tested using many popular Web browsers, such as IE6, IE7, Firefox, and Opera. Queries submitted by a user are firstly stored in the server and then executed one by one in the order of FCFS (first come first serve). The processed results are displayed on a Web page, whose link is sent to the user by email. A sample demonstrating how to initiate a request is shown in Figure 3.

Figure 3
figure 3

The MimoPro server. Users are required to specify both the four-character identifier of an antigen structure in PDB database (PDB_ID) and the identifier of the interacting chain (Chain No). Users are then required to paste the mimotopes derived from phage display experiments. An email address should be specified and the final results will be sent through this email.

The processed results displayed on the Web page include the candidate epitope and the alignments for all mimotope sequences with their P-value scores. These results can be viewed in either text/table or 3D graphics through Jmol [35] that can be adjusted by changing some parameters (Figure 4).

Figure 4
figure 4

Output of MimoPro. The result from test case 1JRH is shown in text/tables (back) and 3D graphics (front). The candidate epitope is shown in the shape of spacefill and cpk color format by default. The display of the 3D structure can be adjusted by operations of Reset, Rotate and Zoom. Users can also click on the check boxes which are labeled with mimotope sequences, so that the corresponding paths on the protein surface are selected and displayed in green. Color and shape of the selected region can be altered by clicking any of the 8 buttons on the bottom. When the best view is reached, the user can save the display of the structure by choosing one of the formats provided in the droplist labeled as 'Save as'.

Validation data

In practice, MimoPro requires only the crystal structure of an antigen, rather than the structure of a complex Ab-Ag. However, in order to validate the outcome of MimoPro, test cases must contain the co-crystal structure of a complex Ab-Ag since the structure of an Ab-Ag complex can tell us the exact location and construction of an epitope. Following this criterion, we collected 18 test cases from various references and each case is identified by the PDB ID of its co-crystal structure (Table 1). Test cases with references starting with 'MS' are entries in a newly released database MimoDB [36] located at

Table 1 Test cases for validation and assessment of MimoPro

The affinity-selected peptides in cases 1JRH and 1BJ1 are derived from point mutation of the original epitopic region of the antigen [37] and of the CDR region of the antibody [38], respectively. These two cases are deemed as simple cases and thus used for validating the viability of MimoPro. The next 11 tests are real cases, in which affinity-selected peptides are mimotopes screened from the phage display libraries with their corresponding antibodies. These cases are used for mapping the mimotopes back to the source antigens so as to locate the native epitopes. The last five cases are used for mapping the affinity-selected peptides to the binding regions of interacting proteins in protein-protein interactions.

Case 1N8Z* shares the same Ab-Ag complex structure with case 1N8Z but is different in mimotopes used [39]. Mimotopes in 1YY9 include one target-unrelated peptide partly binding to the plastic plate in the phage display experiment rather than the corresponding antibody [40]. Therefore, that peptide is removed from the mimotopes of 1YY9 to avoid possible misunderstanding. Locations of native epitopes are derived from conformational epitope database (CED) [41] for those cases of Ab-Ag interaction, including 1JRH, 1G9M, 1E6J, 1N8Z, 1N8Z*, 1IQD, 1YY9, 2ADF, and 1ZTX. For other cases (3IU3, 2GHW, 2NY7, 1AVZ, 1HX1, 1SQ0, 1MQ8, and 1II4), the binding interfaces are inferred from the Contact Map Analysis (CMA) [42].

Indicators and results

Methods of epitope prediction based on mimotope mapping can be roughly classified into two major categories: methods based on statistical features of epitopes and methods based on graph search. MimoPro belongs to the second category. Comparisons in previous studies have shown that methods based on graph search performed better than statistics-based methods on average [19]. In our study, therefore, the performance of MimoPro is only compared with that of other graph-search based methods, such as Pep-3D-Search and PepSurf. Pep-3D-Search is written in whereas PepSurf is implemented using C++. Both are freely accessible for academic use.

To evaluate the performance of MimoPro on a comparable ground with that of both PepSurf and Pep-3D-Search, we adopt the following three commonly used indictors: sensitivity (Se), precision (Pr), and Matthews correlation coefficient (MCC) [20]. They are defined as


In these expressions, TP is the number of true positives; FN is the number of false negatives; FP is the number of false positives; TN is the number of true negatives.

In our study, TP is the number of predicted epitopic amino acids proven to be the true epitopic amino acids. FP is the number of predicted epitopic amino acids proven not to be the true epitopic amino acids. TN is the predicted non-epitopic amino acids proven not to be the true epitopic amino acids. FN is the number of predicted non-epitopic amino acids proven to be the true epitopic amino acids. We use PE to denote the number of all predicted epitopic amino acids (the sum of TP and FP).

The mapping results of all 18 test cases using MimoPro, Pep-3D-Search, and PepSurf are listed in Table 2. Note that results from both Pep-3D-Search and PepSurf are obtained using their default parameters. All these tests were conducted using the same Intel Core 2 Duo processor.

Table 2 Test results from MimoPro, Pep-3D-Search and PepSurf

Feasibility of MimoPro

For the first validation case 1JRH, the known mimotopes mutated from the epitopic region of the source antigen are E45_V46_K47_N48_Y49, Y49_G50_V51_K52_N53, and N53_S54_E55_W56_I57, with a high similarity to the native epitope. Among these mimotope sequences, YGVKN is identical to the native epitopic segment Y49_G50_V51_K52_N53. MimoPro successfully located this epitope on the antigen surface. The resultant patch consists of 31 residues, among which 20 residues are projected to the genuine region of the native epitope. The best matched path on the resultant patch to mimotope sequence YGVKN is Y49_G50_V51_k52_N53, identical to the native epitopic segment. PepSurf and Pep-3D-Search predicted 20 and 17 hits for 1JRH respectively (Table 2). Generally for this validation case, MimoPro and PepSurf have a similar sensitivity, precision and MCC, both being clearly better than Pep-3D-Search.

For the second validation case 1BJ1 where affinity-selected peptides from the peptide library were generated from the randomly mutated CDR region of the antibody, the candidate epitope identified by MimoPro contains 36 residues, in which 15 correlate to the native epitope region that consists of 17 amino acids. PepSurf and Pep-3D-Search predicted 11 and 3 hits for 1BJ1 respectively (Table 2), which puts MimoPro as the absolute best performer among these three in this case.

The next 11 real cases produced mixed outcomes, which indicate that no one dominates over others in all circumstances but each has its advantage in particular cases (Table 2). It is worth mentioning that all mimotopes in these cases, derived from random peptide libraries, show a low sequence homology with the genuine epitopes, and most of these epitopes are discontinuously distributed in separate segments. In general, MimoPro performed better in 1ZTX, 2ADF and 2GHW but slightly worse in 1G9M and 1E6J than both PepSurf and Pep-3D-Search did. In 1IQD that consists of 16 amino acids, no superb result was produced by all three methods. However, MimoPro performed slightly better than the other two because it identified more than half of the genuine epitope.

In 1YY9, MimoPro failed in producing any useful result. This is an extremely hard case where the 14 amino acids forming the epitope include three consecutive segments (Q408_H409, V417_S418, and K465_I466_I467_S468) and six isolated amino acids (R353, Q384, Q438, S440, K443, and N473). As a result, outcomes from both PepSurf and Pep-3D-Search for 1YY9 were not good either.

PepSurf was the best performer in cases 1G9M, 1E6J, 3IU3 and 2NY7 but the worst in 1N8Z, 2ADF and 1ZTX, and even failed in 1N8Z*. On the other hand, Pep-3D-Search produced the best results in both 1N8Z and 1N8Z*, but was rated the last in 1IQD and 2NY7, and even failed in both 3IU3 and 2GHW.

For the last five cases, MimoPro was the best performer in 1SQ0, 1MQ8 and 1II4, and similar to both/either PepSurf and/or Pep-3D-Search in 1AVZ and 1HX1 in predicting the epitopic region of protein-protein interaction. This puts MimoPro as the most effective tool among the three in predicting the epitopic regions of protein-protein interactions.

On average from the 18 test cases, MimoPro achieved the best performance in sensitivity, precision and MCC, compared with both PepSurf and Pep-3D-Search (Table 2). However, this may still be insufficient to specify which method is the best choice because statistics from this small test set can be greatly influenced by a few 'worse' cases. Therefore, more tests using more openly accessible databases for mimotope-based epitope prediction are required before a conclusion on performances of various methods, including MimoPro, can be made.

Impact of compactness factor (CF)

In MimoPro, graph generation from a patch uses an ADT regulated by a uniform CF. This means that individual graphs contain a relatively certain number of edges connecting vertices. Traditionally, graphs delineated using an FDT contain different numbers of edges. To assess the impact of CF on the performance of MimoPro, tests on graphs resulted from using both an ADT guided by a CF of 0.73 ± 0.06 and an FDT of 6.5 Å have been conducted against all 18 cases used earlier. The results are shown in Table 3.

Table 3 Assessment on impact of compactness factor (CF)

In ten of the 18 cases, MimoPro produced more predicted hits on patches linked to graphs using an ADT regulated by a CF of 0.73 ± 0.06 than that on corresponding patches linked to graphs using an FDT of 6.5 Å, except 3IU3 being opposite. There is no difference in predicted hit between the two approaches in other seven cases (1G9M, 1IQD 1YY9, 1ZTX, 2GHW, 1MQ8, and 1II4). This indicates that patches linked to graphs generated using an ADT allow MimoPro to produce better or no worse results than those generated using an FDT do. Note that both approaches still failed in returning any useful hit in case 1YY9.

CF is originally introduced to regulate the complexity of the searching algorithm. In most test cases, processing of MimoPro on a CF-regulated graph is much faster than that on a graph generated by an FDT of 6.5 Å. The most improved cases are 1N8Z and 1N8Z* that show the processing time was dramatically reduced from 3147 and 4845 seconds in circumstances of using this FDT to 234 and 359 seconds respectively in circumstances of using the ADT regulated by the specified CF (Table 3). This is because the source antigen of either 1N8Z or 1N8Z* contains many compact regions and thus a patch covering such region includes significantly more residues than that covering a loose region does. More residues (vertices) imply more time in processing.

Using the same principle, we can calculate the CF of each graph defined using an FDT of 6.5 Å (Table 3). Comparing the paired CF s of all cases, except 1ZTX, 1SQ0, 1MQ8 and 1II4, the CF of each graph defined using the FDT is greater than that of its corresponding graph generated using the ADT regulated by a CF of 0.73 ± 0.06. This means that the former contains more vertices than the latter does, and hence the former requires more processing time than the latter does. Similarly, it is easier to understand why in all exceptional cases the former performed faster than the latter. This is because the former has a lower CF than the latter has.

In summary, firstly, a graph with a higher CF means a higher computing cost but that with a lower CF may not cover sufficient number of residues required for mapping a mimotope sequence. Therefore, choosing an appropriate CF based on empirical data is vital in achieving a satisfactory performance in using MimoPro for epitope prediction. Secondly, MimoPro on graphs regulated by an appropriate CF is more sensitive in detecting epitopic amino acids in most cases than both PepSurf and Pep-3D-Search. Thirdly, MimoPro on graphs regulated by an appropriate CF is more efficient in real applications of epitope prediction because in most cases a result should be produced within 2 minutes, with a maximum limit of 6 minutes for a very difficult case. In this regard, however, PepSurf requires a few hours to process a single peptide sequence if the peptide contains 14 amino acids [19]; Pep-3D-Search is not better either because generating the empirical distribution to get the P-value alone takes 10 minutes [20].

Effects of other parameters

Our method contains two major steps: generation of graph from each surface patch, and selection of the graph with the highest score by aligning every mimotope sequence to each graph using a complete searching algorithm. To generate a graph from a surface patch, the position of a vertex should be specified first by choosing one of the three centers at C α , C β or AHA. In the second step, the scoring of each path depends on the selection of substitution matrices and penalties for gaps. In our study, we assessed the impacts of these parameters on the performance of MimoPro. Results are provided in Additional file 1.


In this study, we proposed a new graph-based mapping method for epitope prediction using affinity-selected peptides derived from phage display experiments. The core of our method is a searching algorithm operated on a series of overlapping patches on the surface of a protein. These patches are then transformed to graphs using an ADT regulated by CF, a novel parameter proposed in this study. These graphs contain a certain number of vertices, which can ensure that searching for each graph is more efficient. This is vastly different from traditional graph-based searching methods that adopt an FDT to define graphs that vary in number of vertices. Searching a graph with a large number of vertices is always slow.

Compared with Pep-3D-Search and PepSurf, two leading graph-based search tools, testing results from MimoPro, the Web-based implementation of our proposed method, have shown that in most cases MimoPro performed equally to or better than both Pep-3D-Search and PepSurf did. On average from 18 test cases, the performance of MimoPro indicated by sensitivity, precision and MCC is better than that of both Pep-3D-Search and PepSurf in epitope prediction. This implies that MimoPro is a viable alternative to, if not the preferred choice, both PepSurf and Pep-3D-Search for epitope prediction in the same kind.

What makes MimoPro more promising over both PepSurf and Pep-3D-Search is that searching over well constructed graphs using an ADT regulated by an appropriate CF is significantly and consistently faster than that of both PepSurf and Pep-3D-Search. This is mainly because such regulated graphs contain a certain number of vertices, which can guarantee that searching for each graph is faster. This further proves that our original concept for improving the search algorism is correct, feasible, and practically useful.

However, for extremely difficult cases where amino acids forming the epitope include both consecutive segments and isolated amino acids, such as 1YY9, MimoPro failed in producing any useful mappings. This indicates where our method can be further improved. Potentially improvement could be made in the following ways. Firstly, the searching algorithm itself could be modified so that the highly rated patches are searched first to make searching more efficient. Secondly, a more appropriate substitution matrix according to a specific application should be adopted so that graph rating is more meaningful to such application. In addition, a refinement model could be introduced to eliminate those insignificant amino acids on a patch so as to accelerate the processing.

Availability and requirements

  • Project Name: MimoPro

  • Project Homepage:

  • Operating System: Platform independent

  • Programming language: C++

  • Other requirements: JRE 5.0 or higher

  • License: GNU GPL

  • Any restrictions to use by non-academics: license needed for commercial use



adaptable distance threshold


accessible surface area


branch and bound

CF :

compactness factor


dynamic programming


extreme value distribution


fixed distance threshold


Matthews correlation coefficient


protein data bank

Pr :



relative solvent accessibility

Se :



  1. Barlow DJ, Edwards MS, Thornton JM: Continuous and discontinuous protein antigenic determinants. Nature 1986, 322(6081):747–748. 10.1038/322747a0

    Article  CAS  PubMed  Google Scholar 

  2. Sollner J, Mayer B: Machine learning approaches for prediction of linear B-cell epitopes on proteins. J Mol Recognit 2006, 19(3):200–208. 10.1002/jmr.771

    Article  PubMed  Google Scholar 

  3. Odorico M, Pellequer JL: BEPITOPE: predicting the location of continuous epitopes and patterns in proteins. J Mol Recognit 2003, 16(1):20–22. 10.1002/jmr.602

    Article  CAS  PubMed  Google Scholar 

  4. Alix AJP: Predictive estimation of protein linear epitopes by using the program PEOPLE. Vaccine 1999, 18(3–4):311–314. 10.1016/S0264-410X(99)00329-1

    Article  CAS  PubMed  Google Scholar 

  5. Parker JM, Guo D, Hodges RS: New hydrophilicity scale derived from high-performance liquid chromatography peptide retention data: correlation of predicted surface residues with antigenicity and X-ray-derived accessible sites. Biochemistry 1986, 25(19):5425–5432. 10.1021/bi00367a013

    Article  CAS  PubMed  Google Scholar 

  6. Hopp TP, Woods KR: Prediction of protein antigenic determinants from amino acid sequences. Proc Natl Acad Sci USA 1981, 78(6):3824–3828. 10.1073/pnas.78.6.3824

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  7. Kulkarni-Kale U, Bhosle S, Kolaskar AS: CEP: a conformational epitope prediction server. Nucleic Acids Res 2005, 33(Web Server issue):W168–171.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  8. Andersen PH, Nielsen M, Lund O: Prediction of residues in discontinuous B-cell epitopes using protein 3D structures. Protein Sci 2006, 15(11):2558–2567. 10.1110/ps.062405906

    Article  CAS  Google Scholar 

  9. Sun J, Wu D, Xu T, Wang X, Xu X, Tao L, Li YX, Cao ZW: SEPPA: a computational server for spatial epitope prediction of protein antigens. Nucleic Acids Res 2009, 37(Web Server issue):W612–616.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  10. Rubinstein ND, Mayrose I, Martz E, Pupko T: Epitopia: a web-server for predicting B-cell epitopes. BMC Bioinformatics 2009, 6: 6–11.

    Google Scholar 

  11. Greenbaum JA, Andersen PH, Blythe M, Bui HH, Cachau RE, Crowe J, Davies M, Kolaskar AS, Lund O, Morrison S: Towards a consensus on datasets and evaluation metrics for developing B-cell epitope prediction tools. J Mol Recognit 2007, 20(2):75–82. 10.1002/jmr.815

    Article  CAS  PubMed  Google Scholar 

  12. Geysen HM, Rodda SJ, Mason TJ: A priori delineation of a peptide which mimics a discontinuous antigenic determinant. Mol Immunol 1986, 23(7):709–715. 10.1016/0161-5890(86)90081-7

    Article  CAS  PubMed  Google Scholar 

  13. Moreau V, Granier C, Villard S, Laune D, Molina F: Discontinuous epitope prediction based on mimotope analysis. Bioinformatics 2006, 22(9):1088–1095. 10.1093/bioinformatics/btl012

    Article  CAS  PubMed  Google Scholar 

  14. Huang J, Gutteridge A, Honda W, Kanehisa M: MIMOX: a web tool for phage display based epitope mapping. BMC Bioinformatics 2006, 7: 451. 10.1186/1471-2105-7-451

    Article  PubMed Central  PubMed  Google Scholar 

  15. Schreiber A, Humbert M, Benz A, Dietrich U: 3D-epitope-explorer (3DEX): Localization of conformational epitopes within three-dimensional structures of proteins. J Comput Chem 2005, 26(9):879–887. 10.1002/jcc.20229

    Article  CAS  PubMed  Google Scholar 

  16. Halperin I, Wolfson H, Nussinov R: SiteLight: Binding-site prediction using phage display libraries. Protein Sci 2003, 12(7):1344–1359. 10.1110/ps.0237103

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  17. Bublil EM, Freund NT, Mayrose I, Penn O, Roitburd-Berman A, Rubinstein ND, Pupko T, Gershoni JM: Stepwise prediction of conformational discontinuous B-Cell Epitopes using the mapitope algorithm. Proteins 2007, 68(1):294–304. 10.1002/prot.21387

    Article  CAS  PubMed  Google Scholar 

  18. Mumey BM, Bailey BW, Kirkpatrick B, Jesaitis AJ, Angel T, Dratz EA: A new method for mapping discontinuous antibody epitopes to reveal structural features of proteins. J Comput Biol 2003, 10(3–4):555–567. 10.1089/10665270360688183

    Article  CAS  PubMed  Google Scholar 

  19. Mayrose I, Shlomi T, Rubinstein ND, Gershoni JM, Ruppin E, Sharan R, Pupko T: Epitope mapping using combinatorial phage display libraries: a graph-based algorithm. Nucleic Acids Res 2007, 35(1):69–78.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  20. Huang YX, Bao YL, Guo SY, Wang Y, Zhou CG, Li YX: Pep-3D-Search: a method for B-cell epitope prediction based on mimotope analysis. BMC Bioinformatics 2008, 9: 538. 10.1186/1471-2105-9-538

    Article  PubMed Central  PubMed  Google Scholar 

  21. Garey MR, Johnson DS: Computers and intractability: a guide to the theory of NP-completeness. San Francisco: W. H. Freeman; 1979.

    Google Scholar 

  22. Alon N, Yuster R, Zwick U: Color-Coding. J Assoc Comput Mach 1995, 42(4):844–856.

    Article  Google Scholar 

  23. Dorigo M, Stützle T: Ant Colony Optimization. MIT Press; 2004.

    Book  Google Scholar 

  24. Cormen TH, Leiserson CE, Rivest RL, Stein C: Introduction to Algorithms. 2nd edition. MIT Press & McGraw-Hill; 2001.

    Google Scholar 

  25. Land AH, Doig AG: An automatic method of solving discrete programming problems. Econometrica 1960, 28(3):497–520. 10.2307/1910129

    Article  Google Scholar 

  26. Sussman JL, Lin DW, Jiang JS, Manning NO, Prilusky J, Ritter O, Abola EE: Protein Data Bank (PDB): Database of three-dimensional structural information of biological macromolecules. Acta Crystallogr D 1998, 54: 1078–1084. 10.1107/S0907444998009378

    Article  CAS  PubMed  Google Scholar 

  27. Connolly ML: Solvent-Accessible Surfaces of Proteins and Nucleic-Acids. Science 1983, 221(4612):709–713. 10.1126/science.6879170

    Article  CAS  PubMed  Google Scholar 

  28. Lee B, Richards FM: The interpretation of protein structures: Estimation of static accessibility. J Mol Biol 1971, 55(3):379–400. IN373-IN374 IN373-IN374 10.1016/0022-2836(71)90324-X

    Article  CAS  PubMed  Google Scholar 

  29. Shrake A, Rupley JA: Environment and exposure to solvent of protein atoms. Lysozyme and insulin. J Mol Biol 1973, 79(2):351–364. 10.1016/0022-2836(73)90011-9

    Article  CAS  PubMed  Google Scholar 

  30. Hubbard SJ, Thornton JM: NACCESS computer program. University College of London, UK 1993.

    Google Scholar 

  31. Tsodikov OV, Record MT, Sergeev YV: Novel computer program for fast exact calculation of accessible and molecular surface areas and average surface curvature. J Comput Chem 2002, 23(6):600–609. 10.1002/jcc.10061

    Article  CAS  PubMed  Google Scholar 

  32. Ahmad S, Gromiha M, Fawareh H, Sarai A: ASAView: Database and tool for solvent accessibility representation in proteins. BMC Bioinformatics 2004, 5(1):51. 10.1186/1471-2105-5-51

    Article  PubMed Central  PubMed  Google Scholar 

  33. Negi SS, Braun W: Automated detection of conformational epitopes using phage display peptide sequences. Bioinformatics Biol Insights 2009, 3: 71–81.

    CAS  Google Scholar 

  34. Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ: Basic local alignment search tool. J Mol Biol 1990, 215(3):403–410.

    Article  CAS  PubMed  Google Scholar 

  35. Jmol: an open-source Java viewer for chemical structure in 3D[]

  36. Ru B, Huang J, Dai P, Li S, Xia Z, Ding H, Lin H, Guo F, Wang X: MimoDB: a new repository for mimotope data derived from phage display technology. Molecules 2010, 15(11):8279–8288. 10.3390/molecules15118279

    Article  CAS  PubMed  Google Scholar 

  37. Lang S, Xu J, Stuart F, Thomas RM, Vrijbloed JW, Robinson JA: Analysis of antibody A6 binding to the extracellular interferon gamma receptor alpha-chain by alanine-scanning mutagenesis and random mutagenesis with phage display. Biochemistry 2000, 39(51):15674–15685. 10.1021/bi000838z

    Article  CAS  PubMed  Google Scholar 

  38. Chen Y, Wiesmann C, Fuh G, Li B, Christinger HW, McKay P, de Vos AM, Lowman HB: Selection and analysis of an optimized anti-VEGF antibody: crystal structure of an affinity-matured fab in complex with antigen. J Mol Biol 1999, 293(4):865–881. 10.1006/jmbi.1999.3192

    Article  CAS  PubMed  Google Scholar 

  39. Riemer AB, Klinger M, Wagner S, Bernhaus A, Mazzucchelli L, Pehamberger H, Scheiner O, Zielinski CC, Jensen-Jarolim E: Generation of Peptide mimics of the epitope recognized by trastuzumab on the oncogenic protein Her-2/neu. J Immunol 2004, 173(1):394–401.

    Article  CAS  PubMed  Google Scholar 

  40. Huang J, Ru B, Li S, Lin H, Guo FB: SAROTUP: scanner and reporter of target-unrelated peptides. J Biomed Biotechnol 2010, 2010: 101932.

    PubMed Central  PubMed  Google Scholar 

  41. Huang J, Honda W: CED: a conformational epitope database. BMC Immunol 2006, 7: 7. 10.1186/1471-2172-7-7

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  42. Sobolev V, Eyal E, Gerzon S, Potapov V, Babor M, Prilusky J, Edelman M: SPACE: a suite of tools for protein structure prediction and analysis based on complementarity and environment. Nucleic Acids Res 2005, 33(Web Server issue):W39–43.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  43. Enshell-Seijffers D, Denisov D, Groisman B, Smelyanski L, Meyuhas R, Gross G, Denisova G, Gershoni JM: The mapping and reconstitution of a conformational discontinuous B-cell epitope of HIV-1. J Mol Biol 2003, 334(1):87–101. 10.1016/j.jmb.2003.09.002

    Article  CAS  PubMed  Google Scholar 

  44. Riemer AB, Kraml G, Scheiner O, Zielinski CC, Jensen-Jarolim E: Matching of trastuzumab (Herceptin) epitope mimics onto the surface of Her-2/neu--a new method of epitope definition. Mol Immunol 2005, 42(9):1121–1124. 10.1016/j.molimm.2004.11.003

    Article  CAS  PubMed  Google Scholar 

  45. Villard S, Lacroix-Desmazes S, Kieber-Emmons T, Piquer D, Grailly S, Benhida A, Kaveri SV, Saint-Remy JM, Granier C: Peptide decoys selected by phage display block in vitro and in vivo activity of a human anti-FVIII inhibitor. Blood 2003, 102(3):949–952. 10.1182/blood-2002-06-1886

    Article  CAS  PubMed  Google Scholar 

  46. Vanhoorelbeke K, Depraetere H, Romijn RA, Huizinga EG, De Maeyer M, Deckmyn H: A consensus tetrapeptide selected by phage display adopts the conformation of a dominant discontinuous epitope of a monoclonal anti-VWF antibody that inhibits the von Willebrand factor-collagen interaction. J Biol Chem 2003, 278(39):37815–37821. 10.1074/jbc.M304289200

    Article  CAS  PubMed  Google Scholar 

  47. Denisova GF, Denisov DA, Yeung J, Loeb MB, Diamond MS, Bramson JL: A novel computer algorithm improves antibody epitope prediction using affinity-selected mimotopes: a case study using monoclonal antibodies against the West Nile virus E protein. Mol Immunol 2008, 46(1):125–134. 10.1016/j.molimm.2008.07.020

    Article  CAS  PubMed  Google Scholar 

  48. R J Rickles MCBZ: Identification of Src, Fyn, Lyn, PI3K and Abl SH3 domain ligands using phage display libraries. EMBO J 1994, 13(23):5598–5604.

    Google Scholar 

  49. Takenaka IM, Leung S-M, McAndrew SJ, Brown JP, Hightower LE: Hsc70-binding Peptides Selected from a Phage Display Peptide Library that Resemble Organellar Targeting Sequences. J Biol Chem 1995, 270(34):19839–19844. 10.1074/jbc.270.34.19839

    Article  CAS  PubMed  Google Scholar 

Download references


We are very grateful to the reviewers and Editors for their constructive comments on the paper, which has brought significant improvement to this work. We also thank Dr. Itay Mayrose for his assistance in early stage of this project. Final proof reading by F Butler is much appreciated. This work was supported by the Natural Science Foundation of Jilin Province (20101503), the Natural Science Foundation of Jilin Province (20101506) and the Scientific and Technical Project of Administration of Traditional Chinese Medicine of Jilin Province (No.2010pt067).

Author information

Authors and Affiliations


Corresponding authors

Correspondence to Yan Xin Huang or Zhi Qiang Ma.

Additional information

Authors' contributions

WHC conceived the idea of this CF-regulated graph search algorithm and was in charge of the MimoPro implementation. He also drafted the first version of the manuscript. PPS and ZQM optimized the algorithm and participated in the development and validation of the Web server. YL and YXH designed experiments, gathered test data, and were in charge of the experiments. YXH supervised the progress of the whole project and critically checked the first draft. WWG was in charge of the whole process of final revision. Working with other authors, particularly WHC, he restructured the paper and rationalized Background, Results and Discussion, and Conclusions, based on the comments received from the reviewers and editors. All authors have read and approved the final manuscript.

Electronic supplementary material


Additional file 1:Supplementary experiment results. Additional file 1 is a single PDF file which includes tables 1 to 3 of supplementary experiment results. (PDF 22 KB)

Authors’ original submitted files for images

Rights and permissions

Open Access This article is published under license to BioMed Central Ltd. This is an Open Access article is distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Chen, W.H., Sun, P.P., Lu, Y. et al. MimoPro: a more efficient Web-based tool for epitope prediction using phage display libraries. BMC Bioinformatics 12, 199 (2011).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: