Essential proteins play an indispensable role in the cellular survival and development. There have been a series of biological experimental methods for finding essential proteins; however they are time-consuming, expensive and inefficient. In order to overcome the shortcomings of biological experimental methods, many computational methods have been proposed to predict essential proteins. The computational methods can be roughly divided into two categories, the topology-based methods and the sequence-based ones. The former use the topological features of protein-protein interaction (PPI) networks while the latter use the sequence features of proteins to predict essential proteins. Nevertheless, it is still challenging to improve the prediction accuracy of the computational methods. Comparing with nonessential proteins, essential proteins appear more frequently in certain subcellular locations and their evolution more conservative. By integrating the information of subcellular localization, orthologous proteins and PPI networks, we propose a novel essential protein prediction method, named SON, in this study. The experimental results on S.cerevisiae data show that the prediction accuracy of SON clearly exceeds that of nine competing methods: DC, BC, IC, CC, SC, EC, NC, PeC and ION. We demonstrate that, by integrating the information of subcellular localization, orthologous proteins with PPI networks, the accuracy of predicting essential proteins can be improved. Our proposed method SON is effective for predicting essential proteins.

Background: Although gene expression data play significant roles in biological and medical studies, their applications are hampered due to the difficulty and high expenses of gathering them through biological experiments. It is an urgent problem to generate high quality gene expression data with computational methods. WGAN-GP, a generative adversarial network-based method, has been successfully applied in augmenting gene expression data. However, mode collapse or over-fitting may take place for small training samples due to just one discriminator is adopted in the method. Results: In this study, an improved data augmentation approach MDWGAN-GP, a generative adversarial network model with multiple discriminators, is proposed. In addition, a novel method is devised for enriching training samples based on linear graph convolutional network. Extensive experiments were implemented on real biological data. Conclusions: The experimental results have demonstrated that compared with other state-of-the-art methods, the MDWGAN-GP method can produce higher quality generated gene expression data in most cases.

With the application and rapid development of high-performance computing and cloud computing technology, the scale of the interconnection network has appeared to grow exponentially. Network attacks have become increasingly sophisticated and stealthy. To reach a high reliable network system, widespread attention has been paid to fault diagnosis. In this article, we put forward a reliable and adaptive self-diagnosis strategy, the $h$-extra $r$-component conditional diagnosability, denoted by $ct_{r}^{h}(G)$. Then, we provide a theoretical derivation to characterize the $h$-extra $r$-component conditional diagnosability of bubble sort networks $B_{n}$ under the PMC model. Furthermore, we develop a fast and adaptive fault self-diagnosis algorithm FAFD-PMC to detect all faulty units. Extensive experiments are implemented and applied to synthetic networks and real networks in terms of accuracy (ACCR), true negative rate, false positive rate, recall, and precision, which demonstrates the ACCR/efficiency of our algorithm.