Xinlong Luo

Xinlong Luo

Auto-generated profile, based on publicly available information

Xinlong Luo

Key Laboratory of Education Blockchain and Intelligent Technology, Ministry of Education, Guangxi Normal University, Guilin, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
16 November 2023 in Health Information Science and Systems
Verified
Journal Article
Closed access
PDF file
GLGaoshi Li
Gaoshi Li
XLXinlong Luo
Xinlong Luo
ZHZhipeng Hu
Zhipeng Hu
JWJingli Wu
Jingli Wu
WPWei Peng
Wei Peng
XZXiaoshu Zhu
Xiaoshu Zhu

24 September 2024 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
ZHZhipeng Hu
Zhipeng Hu
GLGaoshi Li
Gaoshi Li
XLXinlong Luo
Xinlong Luo
WPWei Peng
Wei Peng
JLJiafei Liu
Jiafei Liu
JWJingli Wu
Jingli Wu
Cancer is a complex genomic mutation disease, and identifying cancer driver genes promotes the development of targeted drugs and personalized therapies. The current computational method takes less consideration of the relationship among features and the effect of noise in protein-protein interaction(PPI) data, resulting in a low recognition rate. In this paper, we propose a cancer driver genes identification method based on dynamic incentive model, DIM. This method firstly constructs a hypergraph to reduce the impact of false positive data in PPI. Then, the importance of genes in each hyperedge in hypergraph is considered from three perspectives, network and functional score(NFS) is proposed. By analyzing the relation among features, the dynamic incentive model is proposed to fuse NFS, the differential expression score of mRNA and the differential expression score of miRNA. DIM is compared with some classical methods on breast cancer, lung cancer, prostate cancer, and pan-cancer datasets. The results show that DIM has the best performance on statistical evaluation indicators, functional consistency and the partial area under the ROC curve, and has good cross-cancer capability.

3 January 2025 in IEEE Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
ZHZhipeng Hu
Zhipeng Hu
GLGaoshi Li
Gaoshi Li
XLXinlong Luo
Xinlong Luo
JLJiafei Liu
Jiafei Liu
JWJingli Wu
Jingli Wu
XZXiaoshu Zhu
Xiaoshu Zhu
Essential proteins play an essential role in cell survival and replication. Currently, more and more computational methods are developed to identify essential proteins, which overcome the time-consuming, costly and inefficient shortcomings with biological experimental methods.In order to improve the recognition rate, some new methods by fusing multiple features are developed, but they seldom consider the connection among features. After analyzing a large number of methods based on multi-feature fusion, a phenomenon among features is found, called weak consensus,then a weak consensus model to fuse these features is proposed in this paper.After analyzing the relationship between a protein and its neighbors in protein-protein interaction networks, a new centrality, namely neighborhood aggregation centrality(NAC) is developed in this paper.Then, a Max-Min strategy is used to integrate NAC with Pearson correlation coefficient and Jaccard similarity coefficient based on gene expression data to obtain local importance score. In addition, orthologous feature score is used to measure proteins conservation.Finally,by using the weak consensus model to fuse orthologous feature score with local importance score, a new method WOL is proposed in this paper.Then experiments are performed on S.cerevisiae data. The results show that compared with WDC, PeC, ION, JDC, NCCO and E_POC, WOL has a higher recognition rate.

1 June 2026 in IEEE Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
XLXinlong Luo
Xinlong Luo
GLGaoshi Li
Gaoshi Li
ZHZhipeng Hu
Zhipeng Hu
JWJingli Wu
Jingli Wu
WPWei Peng
Wei Peng
XZXiaoshu Zhu
Xiaoshu Zhu
Essential proteins are a crucial component of living organisms, and their absence will lead to cell death or reproductive arrest. Discovering these proteins can propel advancements in synthetic biology and facilitate the development of novel antibiotics and therapies for various diseases. However, current computational methods suffer from two major drawbacks that hinder their discovery rate: one is the significant noise in protein-protein interaction (PPI) data, and the other is the inadequate consideration of feature relationships. To enhance identification capabilities, this study proposes a novel essential protein prediction method, Feature Synergy Method (FSM), which leverages a features synergy model and GO pure centrality. The FSM is described as folows:Firstly, based on the principle of co-expression, gene expression data are integrated with the original PPI network to construct a pure PPI network (PPIN). Subsequently, GO annotation data are employed to calculate GO_sim weights for the interactions within the original PPI network, forming a GS_PIN. The PPIN and GS_PIN are then fused to establish the GS_PPIN, which helps mitigate the impact of noise in PPI data. Secondly, a new centrality measure, GO pure centrality (GPC), is designed based on this GO similarity-weighted pure PPI network. Thirdly, an evolutionary conservation score (ECS) is extracted from subcellular localization and orthologous proteins data. Fourthly, after analyzing the relationship between GPC and ECS, a novel fusion model, the features synergy model, is developed to integrate GPC and ECS, ultimately leading to the proposal of the new essential protein prediction method, FSM. To validate the performance of FSM, six computational methods (PeC, WDC, ION, NCCO, E_POC, and JDC) and six centrality measures (NC, IC, EC, SC, CC, and DC) were evaluated on three distinct yeast datasets. The results demonstrate that FSM achieves a higher essential protein identification rate. Similarly, GPC identifies more essential proteins compared to the six centrality-based approaches (NC, IC, EC, SC, CC, and DC).