Lianyin Jia

Prof. Lianyin Jia

Kunming University of Science and Technology, Kunming, Yunnan, China
orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-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
JWJun Wang
Jun Wang
LZLong Zhang
Long Zhang
LJLianyin Jia
Lianyin Jia
YRYazhou Ren
Yazhou Ren
Guoxian YuGuoxian Yu
Guoxian Yu
Protein-protein interactions (PPIs) play crucial roles in almost all cellular processes. Although a large amount of PPIs have been verified by high-throughput techniques in the past decades, currently known PPIs pairs are still far from complete. Furthermore, the wet-lab experiments based techniques for detecting PPIs are time-consuming and expensive. Hence, it is urgent and essential to develop automatic computational methods to efficiently and accurately predict PPIs. In this paper, a sequence-based approach called DNN-LCTD is developed by combining deep neural networks (DNNs) and a novel local conjoint triad description (LCTD) feature representation. LCTD incorporates the advantage of local description and conjoint triad, thus, it is capable to account for the interactions between residues in both continuous and discontinuous regions of amino acid sequences. DNNs can not only learn suitable features from the data by themselves, but also learn and discover hierarchical representations of data. When performing on the PPIs data of Saccharomyces cerevisiae, DNN-LCTD achieves superior performance with accuracy as 93.12%, precision as 93.75%, sensitivity as 93.83%, area under the receiver operating characteristic curve (AUC) as 97.92%, and it only needs 718 s. These results indicate DNN-LCTD is very promising for predicting PPIs. DNN-LCTD can be a useful supplementary tool for future proteomics study.

6 October 2022 in Frontiers in Oncology
Verified
Journal Article
Open access
KJKaijun Jiang
Kaijun Jiang
YAYiqin Ai
Yiqin Ai
YLYanqing Li
Yanqing Li
LJLianyin Jia
Lianyin Jia
Background: Cervical cancer (CC) is one of the most common cancers in women. This study aimed to investigate the clinical and non-clinical features that may affect the prognosis of patients with CC and to develop accurate prognostic models with respect to overall survival (OS) and cancer-specific survival (CSS).Methods: We identified 11,148 patients with CC from the SEER (Surveillance, Epidemiology, and End Results) database from 2010 to 2016. Univariate and multivariate Cox regression models were used to identify potential predictors of patients’ survival outcomes (OS and CSS). We selected meaningful independent parameters and developed nomogram models for 1-, 3-, and 5-year OS and CSS via R tools. Model performance was evaluated by C-index and receiver operating characteristic curve. Furthermore, calibration curves were plotted to compare the predictions of nomograms with observed outcomes, and decision curve analysis (DCA) and clinical impact curves (CICs) were used to evaluate the clinical effectiveness of the nomograms.Results: All eligible patients (n=11148) were randomized at a 7:3 ratio into training (n=7803) and validation (n=3345) groups. Ten variables were identified as common independent predictors of OS and CSS: insurance status, grade, histology, chemotherapy, metastasis number, tumor size, regional nodes examined, International Federation of Obstetrics and Gynecology stage, lymph vascular space invasion (LVSI), and radiation. The C-index values for OS (0.831 and 0.824) and CSS (0.844 and 0.841) in the training cohorts and validation cohorts, respectively, indicated excellent discrimination performance of the nomograms. The internal and external calibration plots indicated excellent agreement between nomogram prediction and actual survival, and the DCA and CICs reflected favorable potential clinical effects.Conclusions: We constructed nomograms that could predict 1-, 3-, and 5-year OS and CSS in patients with CC. These tools showed near-perfect accuracy and clinical utility; thus, they could lead to better patient counseling and personalized and tailored treatment to improve clinical prognosis.

Verified
Journal Article
Open access
PDF file
XCXia Cao
Xia Cao
Guoxian YuGuoxian Yu
Guoxian Yu
JLJie Liu
Jie Liu
LJLianyin Jia
Lianyin Jia
JWJun Wang
Jun Wang
Identifying single nucleotide polymorphism (SNP) interactions is considered as a popular and crucial way for explaining the missing heritability of complex diseases in genome-wide association studies (GWAS). Many approaches have been proposed to detect SNP interactions. However, existing approaches generally suffer from the high computational complexity resulting from the explosion of candidate high-order interactions. In this paper, we propose a two-stage approach (called ClusterMI) to detect high-order genome-wide SNP interactions based on significant pairwise SNP combinations. In the screening stage, to alleviate the huge computational burden, ClusterMI firstly applies a clustering algorithm combined with mutual information to divide SNPs into different clusters. Then, ClusterMI utilizes conditional mutual information to screen significant pairwise SNP combinations in each cluster. In this way, there is a higher probability of identifying significant two-locus combinations in each group, and the computational load for the follow-up search can be greatly reduced. In the search stage, two different search strategies (exhaustive search and improved ant colony optimization search) are provided to detect high-order SNP interactions based on the cardinality of significant two-locus combinations. Extensive simulation experiments show that ClusterMI has better performance than other related and competitive approaches. Experiments on two real case-control datasets from Wellcome Trust Case Control Consortium (WTCCC) also demonstrate that ClusterMI is more capable of identifying high-order SNP interactions from genome-wide data.

16 April 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
RLRunxin Li
Runxin Li
GZGaozhi Zhou
Gaozhi Zhou
XLXiaowu Li
Xiaowu Li
LJLianyin Jia
Lianyin Jia
ZSZhenhong Shang
Zhenhong Shang

14 August 2024 in Neurocomputing
Verified
Journal Article
Closed access
GZGaozhi Zhou
Gaozhi Zhou
RLRunxin Li
Runxin Li
ZSZhenhong Shang
Zhenhong Shang
XLXiaowu Li
Xiaowu Li
LJLianyin Jia
Lianyin Jia

17 February 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
RLRunxin Li
Runxin Li
XYXiong Yang
Xiong Yang
XLXiaowu Li
Xiaowu Li
GSGuofeng Shu
Guofeng Shu
LJLianyin Jia
Lianyin Jia
ZSZhenhong Shang
Zhenhong Shang