Identifying Protein Complexes With Clear Module Structure Using Pairwise Constraints in Protein Interaction Networks

Implications of ZNF334 gene in lymph node metastasis of lung SCC: potential bypassing of cellular senescence

BACKGROUND

The primary goal of this work is to identify biomarkers associated with lung squamous cell carcinoma and assess their potential for early detection of lymph node metastasis.

METHODS

This study investigated gene expression in lymph node metastasis of lung squamous cell carcinoma using data from the Cancer Genome Atlas and R software. Protein-protein interaction networks, hub genes, and enriched pathways were analyzed. ZNF334 and TINAGL1, two less explored genes, were further examined through in vitro, ex vivo, and in vivo experiments to validate the findings from bioinformatics analyses. The role of ZNF334 and TINAGL1 in senescence induction was assessed after H2O2 and UV induced senescence phenotype determined using β-galactosidase activity and cell cycle status assay.

RESULTS

We identified a total of 611 up- and 339 down-regulated lung squamous cell carcinoma lymph node metastasis-associated genes (FDR < 0.05). Pathway enrichment analysis highlighted the central respiratory pathway within mitochondria for the subnet genes and the nuclear DNA-directed RNA polymerases for the hub genes. Significantly down regulation of ZNF334 gene was associated with malignancy lymph node progression and senescence induction has significantly altered ZNF334 expression (with consistency in bioinformatics, in vitro, ex vivo, and in vivo results). Deregulation of TINAGL1 expression with inconsistency in bioinformatics, in vitro (different types of lung squamous cancer cell lines), ex vivo, and in vivo results, was also associated with malignancy lymph node progression and altered in senescence phenotype.

CONCLUSIONS

ZNF334 is a highly generalizable gene to lymph node metastasis of lung squamous cell carcinoma and its expression alter certainly under senescence conditions.

Network analysis of the proteome and peptidome sheds light on human milk as a biological system

Proteins and peptides found in human milk have bioactive potential to benefit the newborn and support healthy development. Research has been carried out on the health benefits of proteins and peptides, but many questions still need to be answered about the nature of these components, how they are formed, and how they end up in the milk. This study explored and elucidated the complexity of the human milk proteome and peptidome. Proteins and peptides were analyzed with non-targeted nanoLC-Orbitrap-MS/MS in a selection of 297 milk samples from the CHILD Cohort Study. Protein and peptide abundances were determined, and a network was inferred using Gaussian graphical modeling (GGM), allowing an investigation of direct associations. This study showed that signatures of (1) specific mechanisms of transport of different groups of proteins, (2) proteolytic degradation by proteases and aminopeptidases, and (3) coagulation and complement activation are present in human milk. These results show the value of an integrated approach in evaluating large-scale omics data sets and provide valuable information for studies that aim to associate protein or peptide profiles from biofluids such as milk with specific physiological characteristics.

A self-training subspace clustering algorithm based on adaptive confidence for gene expression data

Gene clustering is one of the important techniques to identify co-expressed gene groups from gene expression data, which provides a powerful tool for investigating functional relationships of genes in biological process. Self-training is a kind of important semi-supervised learning method and has exhibited good performance on gene clustering problem. However, the self-training process inevitably suffers from mislabeling, the accumulation of which will lead to the degradation of semi-supervised learning performance of gene expression data. To solve the problem, this paper proposes a self-training subspace clustering algorithm based on adaptive confidence for gene expression data (SSCAC), which combines the low-rank representation of gene expression data and adaptive adjustment of label confidence to better guide the partition of unlabeled data. The superiority of the proposed SSCAC algorithm is mainly reflected in the following aspects. 1) In order to improve the discriminative property of gene expression data, the low-rank representation with distance penalty is used to mine the potential subspace structure of data. 2) Considering the problem of mislabeling in self-training, a semi-supervised clustering objective function with label confidence is proposed, and a self-training subspace clustering framework is constructed on this basis. 3) In order to mitigate the negative impact of mislabeled data, an adaptive adjustment strategy based on gravitational search algorithm is proposed for label confidence. Compared with a variety of state-of-the-art unsupervised and semi-supervised learning algorithms, the SSCAC algorithm has demonstrated its superiority through extensive experiments on two benchmark gene expression datasets.

An Ensemble Learning Framework for Detecting Protein Complexes From PPI Networks

Detecting protein complexes is one of the keys to understanding cellular organization and processes principles. With high-throughput experiments and computing science development, it has become possible to detect protein complexes by computational methods. However, most computational methods are based on either unsupervised learning or supervised learning. Unsupervised learning-based methods do not need training datasets, but they can only detect one or several topological protein complexes. Supervised learning-based methods can detect protein complexes with different topological structures. However, they are usually based on a type of training model, and the generalization of a single model is poor. Therefore, we propose an Ensemble Learning Framework for Detecting Protein Complexes (ELF-DPC) within protein-protein interaction (PPI) networks to address these challenges. The ELF-DPC first constructs the weighted PPI network by combining topological and biological information. Second, it mines protein complex cores using the protein complex core mining strategy we designed. Third, it obtains an ensemble learning model by integrating structural modularity and a trained voting regressor model. Finally, it extends the protein complex cores and forms protein complexes by a graph heuristic search strategy. The experimental results demonstrate that ELF-DPC performs better than the twelve state-of-the-art approaches. Moreover, functional enrichment analysis illustrated that ELF-DPC could detect biologically meaningful protein complexes. The code/dataset is available for free download from https://github.com/RongquanWang/ELF-DPC.

An Improved Memetic Algorithm for Detecting Protein Complexes in Protein Interaction Networks

Identifying the protein complexes in protein-protein interaction (PPI) networks is essential for understanding cellular organization and biological processes. To address the high false positive/negative rates of PPI networks and detect protein complexes with multiple topological structures, we developed a novel improved memetic algorithm (IMA). IMA first combines the topological and biological properties to obtain a weighted PPI network with reduced noise. Next, it integrates various clustering results to construct the initial populations. Furthermore, a fitness function is designed based on the five topological properties of the protein complexes. Finally, we describe the rest of our IMA method, which primarily consists of four steps: selection operator, recombination operator, local optimization strategy, and updating the population operator. In particular, IMA is a combination of genetic algorithm and a local optimization strategy, which has a strong global search ability, and searches for local optimal solutions effectively. The experimental results demonstrate that IMA performs much better than the base methods and existing state-of-the-art techniques. The source code and datasets of the IMA can be found at https://github.com/RongquanWang/IMA.

A New Method for Recognizing Protein Complexes Based on Protein Interaction Networks and GO Terms

Motivation: A protein complex is the combination of proteins which interact with each other. Protein–protein interaction (PPI) networks are composed of multiple protein complexes. It is very difficult to recognize protein complexes from PPI data due to the noise of PPI.

Results: We proposed a new method, called Topology and Semantic Similarity Network (TSSN), based on topological structure characteristics and biological characteristics to construct the PPI. Experiments show that the TSSN can filter the noise of PPI data. We proposed a new algorithm, called Neighbor Nodes of Proteins (NNP), for recognizing protein complexes by considering their topology information. Experiments show that the algorithm can identify more protein complexes and more accurately. The recognition of protein complexes is vital in research on evolution analysis.

Availability and implementation: https://github.com/bioinformatical-code/NNP.