Guixia Liu

Guixia Liu


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
JSJiaZhi Song
JiaZhi Song
GLGuixia Liu
Guixia Liu
JJJingqing Jiang
Jingqing Jiang
PZPing Zhang
Ping Zhang
YLYanchun Liang
Yanchun Liang
Accurately identifying protein–ATP binding residues is important for protein function annotation and drug design. Previous studies have used classic machine-learning algorithms like support vector machine (SVM) and random forest to predict protein–ATP binding residues; however, as new machine-learning techniques are being developed, the prediction performance could be further improved. In this paper, an ensemble predictor that combines deep convolutional neural network and LightGBM with ensemble learning algorithm is proposed. Three subclassifiers have been developed, including a multi-incepResNet-based predictor, a multi-Xception-based predictor, and a LightGBM predictor. The final prediction result is the combination of outputs from three subclassifiers with optimized weight distribution. We examined the performance of our proposed predictor using two datasets: a classic ATP-binding benchmark dataset and a newly proposed ATP-binding dataset. Our predictor achieved area under the curve (AUC) values of 0.925 and 0.902 and Matthews Correlation Coefficient (MCC) values of 0.639 and 0.642, respectively, which are both better than other state-of-art prediction methods.

11 April 2022 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
LSLei Song
Lei Song
GLGuixia Liu
Guixia Liu
MMMingrui Ma
Mingrui Ma

14 September 2019 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
RWRongquan Wang
Rongquan Wang
GLGuixia Liu
Guixia Liu
CWCaixia Wang
Caixia Wang
Background: Protein complex identification from protein-protein interaction (PPI) networks is crucial for understanding cellular organization principles and functional mechanisms. In recent decades, numerous computational methods have been proposed to identify protein complexes. However, most of the current state-of-the-art studies still have some challenges to resolve, including their high false-positives rates, incapability of identifying overlapping complexes, lack of consideration for the inherent organization within protein complexes, and absence of some biological attachment proteins.Results: In this paper, to overcome these limitations, we present a protein complex identification method based on an edge weight method and core-attachment structure (EWCA) which consists of a complex core and some sparse attachment proteins. First, we propose a new weighting method to assess the reliability of interactions. Second, we identify protein complex cores by using the structural similarity between a seed and its direct neighbors. Third, we introduce a new method to detect attachment proteins that is able to distinguish and identify peripheral proteins and overlapping proteins. Finally, we bind attachment proteins to their corresponding complex cores to form protein complexes and discard redundant protein complexes. The experimental results indicate that EWCA outperforms existing state-of-the-art methods in terms of both accuracy andp-value. Furthermore, EWCA could identify many more protein complexes with statistical significance. Additionally, EWCA could have better balance accuracy and efficiency than some state-of-the-art methods with high accuracy.Conclusions: In summary, EWCA has better performance for protein complex identification by a comprehensive comparison with twelve algorithms in terms of different evaluation metrics. The datasets and software are freely available for academic research athttps://github.com/RongquanWang/EWCA.

22 August 2018 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
RWRongquan Wang
Rongquan Wang
GLGuixia Liu
Guixia Liu
CWCaixia Wang
Caixia Wang
LSLingtao Su
Lingtao Su
LSLiyan Sun
Liyan Sun
In recent decades, detecting protein complexes (PCs) from protein-protein interaction networks (PPINs) has been an active area of research. There are a large number of excellent graph clustering methods that work very well for identifying PCs. However, most of existing methods usually overlook the inherent core-attachment organization of PCs. Therefore, these methods have three major limitations we should concern. Firstly, many methods have ignored the importance of selecting seed, especially without considering the impact of overlapping nodes as seed nodes. Thus, there may be false predictions. Secondly, PCs are generally supposed to be dense subgraphs. However, the subgraphs with high local modularity structure usually correspond to PCs. Thirdly, a number of available methods lack handling noise mechanism, and miss some peripheral proteins. In summary, all these challenging issues are very important for predicting more biological overlapping PCs. In this paper, to overcome these weaknesses, we propose a clustering method by core-attachment and local modularity structure, named CALM, to detect overlapping PCs from weighted PPINs with noises. Firstly, we identify overlapping nodes and seed nodes. Secondly, for a node, we calculate the support function between a node and a cluster. In CALM, a cluster which initially consists of only a seed node, is extended by adding its direct neighboring nodes recursively according to the support function, until this cluster forms a locally optimal modularity subgraph. Thirdly, we repeat this process for the remaining seed nodes. Finally, merging and removing procedures are carried out to obtain final predicted clusters. The experimental results show that CALM outperforms other classical methods, and achieves ideal overall performance. Furthermore, CALM can match more complexes with a higher accuracy and provide a better one-to-one mapping with reference complexes in all test datasets. Additionally, CALM is robust against the high rate of noise PPIN. By considering core-attachment and local modularity structure, CALM could detect PCs much more effectively than some representative methods. In short, CALM could potentially identify previous undiscovered overlapping PCs with various density and high modularity.

8 March 2022 in Frontiers in Pharmacology
Verified
Journal Article
Open access
JLJi Lv
Ji Lv
GLGuixia Liu
Guixia Liu
YJYuan Ju
Yuan Ju
YSYing Sun
Ying Sun
WGWeiying Guo
Weiying Guo
Antibiotic resistance is a major public health concern. Antibiotic combinations, offering better efficacy at lower doses, are a useful way to handle this problem. However, it is difficult for us to find effective antibiotic combinations in the vast chemical space. Herein, we propose a graph learning framework to predict synergistic antibiotic combinations. In this model, a network proximity method combined with network propagation was used to quantify the relationships of drug pairs, and we found that synergistic antibiotic combinations tend to have smaller network proximity. Therefore, network proximity can be used for building an affinity matrix. Subsequently, the affinity matrix was fed into a graph regularization model to predict potential synergistic antibiotic combinations. Compared with existing methods, our model shows a better performance in the prediction of synergistic antibiotic combinations and interpretability.

20 September 2010 in Algorithms for Molecular Biology
Verified
Journal Article
Open access
MZMing Zheng
Ming Zheng
GLGuixia Liu
Guixia Liu
CZChun-Guang Zhou
Chun-Guang Zhou
YLYanchun Liang
Yanchun Liang
YWYan Wang
Yan Wang
Background: Searching optima is one of the most challenging tasks in clustering genes from available experimental data or given functions. SA, GA, PSO and other similar efficient global optimization methods are used by biotechnologists. All these algorithms are based on the imitation of natural phenomena. Results: This paper proposes a novel searching optimization algorithm called Gravitation Field Algorithm (GFA) which is derived from the famous astronomy theory Solar Nebular Disk Model (SNDM) of planetary formation. GFA simulates the Gravitation field and outperforms GA and SA in some multimodal functions optimization problem. And GFA also can be used in the forms of unimodal functions. GFA clusters the dataset well from the Gene Expression Omnibus. Conclusions: The mathematical proof demonstrates that GFA could be convergent in the global optimum by probability 1 in three conditions for one independent variable mass functions. In addition to these results, the fundamental optimization concept in this paper is used to analyze how SA and GA affect the global search and the inherent defects in SA and GA. Some results and source code (in Matlab) are publicly available at http://ccst.jlu.edu.cn/CSBG/GFA.