Identification of epitopes which invoke strong humoral responses is an essential issue in the field of immunology. Localizing epitopes by experimental methods is expensive in terms of time, cost, and effort; therefore, computational methods feature for its low cost and high speed was employed to predict B-cell epitopes. In this paper, we review the recent advance of bioinformatics resources and tools in conformational B-cell epitope prediction, including databases, algorithms, web servers, and their applications in solving problems in related areas. To stimulate the development of better tools, some promising directions are also extensively discussed.

Background: 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. Results: 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. Conclusions: 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 http://informatics.nenu.edu.cn/MimoPro.

Path-planning for uninhabited combat air vehicles (UCAV) is a typically complicated global optimization problem. It seeks a superior flight path in a complex battlefield environment, taking into various constraints. Many swarm intelligence (SI) algorithms have recently gained remarkable attention due to their capability to address complex optimization problems. However, different SI algorithms present various performances for UCAV path-planning since each algorithm has its own strengths and weaknesses. Therefore, this study provides an overview of different SI algorithms for UCAV path-planning research. In the experiment, twelve algorithms that published in major journals and conference proceedings are surveyed and then applied to UCAV path-planning. Moreover, to demonstrate the performance of different algorithms in further, we design different scales of problem cases for those comparative algorithms. The experimental results show that UCAV can find the safe path to avoid the threats efficiently based on most SI algorithms. In particular, the Spider Monkey Optimization is more effective and robust than other algorithms in handling the UCAV path-planning problem. The analysis from different perspectives contributes to highlight trends and open issues in the field of UCAVs.

Background: Somitogenesis is a fundamental characteristic feature of development in various animal embryos. Molecular evidence has proved that the Notch and Wnt pathways play important roles in regulating the process of somitogenesis and there is crosstalk between these two pathways. However, it is difficult to investigate the detailed mechanism of these two pathways and their interactions in somitogenesis through biological experiments. In recent years some mathematical models have been proposed for the purpose of studying the dynamics of the Notch and Wnt pathways in somitogenesis. Unfortunately, only a few of these models have explored the interactions between them. Results: In this study, we have proposed three mathematical models for the Notch signalling pathway alone, the Wnt signalling pathway alone, and the interactions between them. These models can simulate the dynamics of the Notch and Wnt pathways in somitogenesis, and are capable of reproducing the observations derived from wet experiments. They were used to investigate the molecular mechanisms of the Notch and Wnt pathways and their crosstalk in somitogenesis through the model simulations. Conclusions: Three mathematical models are proposed for the Notch and Wnt pathways and their interaction during somitogenesis. The simulations demonstrate that the extracellular Notch and Wnt signals are essential for the oscillating expressions of both Notch and Wnt target genes. Moreover, the internal negative feedback loops and the three levels of crosstalk between these pathways play important but distinct roles in maintaining the system oscillation. In addition, the results of the parameter sensitivity analysis of the models indicate that the Notch pathway is more sensitive to perturbation in somitogenesis.

Membrane proteins (MPs) are involved in many essential biomolecule mechanisms as a pivotal factor in enabling the small molecule and signal transport between the two sides of the biological membrane; this is the reason that a large portion of modern medicinal drugs target MPs. Therefore, accurately identifying the membrane protein-ligand binding sites (MPLs) will significantly improve drug discovery. In this paper, we propose a sequence-based MPLs predictor called MPLs-Pred, where evolutionary profiles, topology structure, physicochemical properties, and primary sequence segment descriptors are combined as features applied to a random forest classifier, and an under-sampling scheme is used to enhance the classification capability with imbalanced samples. Additional ligand-specific models were taken into consideration in refining the prediction. The corresponding experimental results based on our method achieved an appreciable performance, with 0.63 MCC (Matthews correlation coefficient) as the overall prediction precision, and those values were 0.604, 0.7, and 0.692, respectively, for the three main types of ligands: drugs, metal ions, and biomacromolecules. MPLs-Pred is freely accessible at http://icdtools.nenu.edu.cn/.

Epitope prediction based on random peptide library screening has become a focus as a promising method in immunoinformatics research. Some novel software and web-based servers have been proposed in recent years and have succeeded in given test cases. However, since the number of available mimotopes with the relevant structure of template-target complex is limited, a systematic evaluation of these methods is still absent. In this study, a new benchmark dataset was defined. Using this benchmark dataset and a representative dataset, five examples of the most popular epitope prediction software products which are based on random peptide library screening have been evaluated. Using the benchmark dataset, in no method did performance exceed a 0.42 precision and 0.37 sensitivity, and the MCC scores suggest that the epitope prediction results of these software programs are greater than random prediction about 0.09–0.13; while using the representative dataset, most of the values of these performance measures are slightly improved, but the overall performance is still not satisfactory. Many test cases in the benchmark dataset cannot be applied to these pieces of software due to software limitations. Moreover chances are that these software products are overfitted to the small dataset and will fail in other cases. Therefore finding the correlation between mimotopes and genuine epitope residues is still far from resolved and much larger dataset for mimotope-based epitope prediction is desirable.