Boya Ji

Boya Ji

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Boya Ji has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    CellMsg: graph convolutional networks for ligand–receptor-mediated cell-cell communication analysis

    by Hong Xia, Boya Ji, Debin Qiao, Shaoliang Peng

    The role of cell-cell communications (CCCs) is increasingly recognized as being important to differentiation, invasion, metastasis, and drug resistance in tumoral tissues. Developing CCC inference methods using traditional experimental methods are time-consuming, labor-intensive, cannot handle large amounts of data. To facilitate inference of CCCs, we proposed a computational framework, called CellMsg, which involves two primary steps: identifying ligand–receptor interactions (LRIs) and measuring the strength of LRIs-mediated CCCs. Specifically, CellMsg first identifies high-confident LRIs based on multimodal features of ligands and receptors and graph convolutional networks. Then, CellMsg measures the strength of intercellular communication by combining the identified LRIs and single-cell RNA-seq data using a three-point estimation method. Performance evaluation on four benchmark LRI datasets by five-fold cross validation demonstrated that CellMsg accurately captured the relationships between ligands and receptors, resulting in the identification of high-confident LRIs. Compared with other methods of identifying LRIs, CellMsg has better prediction performance and robustness. Furthermore, the LRIs identified by CellMsg were successfully validated through molecular docking. Finally, we examined the overlap of LRIs between CellMsg and five other classical CCC databases, as well as the intercellular crosstalk among seven cell types within a human melanoma tissue. In summary, CellMsg establishes a complete, reliable, and well-organized LRI database and an effective CCC strength evaluation method for each single-cell RNA-seq data. It provides a computational tool allowing researchers to decipher intercellular communications. CellMsg is freely available at https://github.com/pengsl-lab/CellMsg.


  • Open Access

    SAE-Impute: imputation for single-cell data via subspace regression and auto-encoders

    by Liang Bai, Boya Ji, Shulin Wang

    Single-cell RNA sequencing (scRNA-seq) technology has emerged as a crucial tool for studying cellular heterogeneity. However, dropouts are inherent to the sequencing process, known as dropout events, posing challenges in downstream analysis and interpretation. Imputing dropout data becomes a critical concern in scRNA-seq data analysis. Present imputation methods predominantly rely on statistical or machine learning approaches, often overlooking inter-sample correlations. To address this limitation, We introduced SAE-Impute, a new computational method for imputing single-cell data by combining subspace regression and auto-encoders for enhancing the accuracy and reliability of the imputation process. Specifically, SAE-Impute assesses sample correlations via subspace regression, predicts potential dropout values, and then leverages these predictions within an autoencoder framework for interpolation. To validate the performance of SAE-Impute, we systematically conducted experiments on both simulated and real scRNA-seq datasets. These results highlight that SAE-Impute effectively reduces false negative signals in single-cell data and enhances the retrieval of dropout values, gene-gene and cell-cell correlations. Finally, We also conducted several downstream analyses on the imputed single-cell RNA sequencing (scRNA-seq) data, including the identification of differential gene expression, cell clustering and visualization, and cell trajectory construction. These results once again demonstrate that SAE-Impute is able to effectively reduce the droupouts in single-cell dataset, thereby improving the functional interpretability of the data.


  • Open Access

    A multi-source molecular network representation model for protein–protein interactions prediction

    by Hai-Tao Zou, Bo-Ya Ji, Xiao-Lan Xie

    The prediction of potential protein–protein interactions (PPIs) is a critical step in decoding diseases and understanding cellular mechanisms. Traditional biological experiments have identified plenty of potential PPIs in recent years, but this problem is still far from being solved. Hence, there is urgent to develop computational models with good performance and high efficiency to predict potential PPIs. In this study, we propose a multi-source molecular network representation learning model (called MultiPPIs) to predict potential protein–protein interactions. Specifically, we first extract the protein sequence features according to the physicochemical properties of amino acids by utilizing the auto covariance method. Second, a multi-source association network is constructed by integrating the known associations among miRNAs, proteins, lncRNAs, drugs, and diseases. The graph representation learning method, DeepWalk, is adopted to extract the multisource association information of proteins with other biomolecules. In this way, the known protein–protein interaction pairs can be represented as a concatenation of the protein sequence and the multi-source association features of proteins. Finally, the Random Forest classifier and corresponding optimal parameters are used for training and prediction. In the results, MultiPPIs obtains an average 86.03% prediction accuracy with 82.69% sensitivity at the AUC of 93.03% under five-fold cross-validation. The experimental results indicate that MultiPPIs has a good prediction performance and provides valuable insights into the field of potential protein–protein interactions prediction. MultiPPIs is free available at https://github.com/jiboyalab/multiPPIs.


  • Open Access

    SMMDA: Predicting miRNA-Disease Associations by Incorporating Multiple Similarity Profiles and a Novel Disease Representation

    by Bo-Ya Ji, Liang-Rui Pan, Ji-Ren Zhou, Zhu-Hong You, Shao-Liang Peng

    Increasing evidence has suggested that microRNAs (miRNAs) are significant in research on human diseases. Predicting possible associations between miRNAs and diseases would provide new perspectives on disease diagnosis, pathogenesis, and gene therapy. However, considering the intrinsic time-consuming and expensive cost of traditional Vitro studies, there is an urgent need for a computational approach that would allow researchers to identify potential associations between miRNAs and diseases for further research. In this paper, we presented a novel computational method called SMMDA to predict potential miRNA-disease associations. In particular, SMMDA first utilized a new disease representation method (MeSHHeading2vec) based on the network embedding algorithm and then fused it with Gaussian interaction profile kernel similarity information of miRNAs and diseases, disease semantic similarity, and miRNA functional similarity. Secondly, SMMDA utilized a deep auto-coder network to transform the original features further to achieve a better feature representation. Finally, the ensemble learning model, XGBoost, was used as the underlying training and prediction method for SMMDA. In the results, SMMDA acquired a mean accuracy of 86.68% with a standard deviation of 0.42% and a mean AUC of 94.07% with a standard deviation of 0.23%, outperforming many previous works. Moreover, we also compared the predictive ability of SMMDA with different classifiers and different feature descriptors. In the case studies of three common Human diseases, the top 50 candidate miRNAs have 47 (esophageal neoplasms), 48 (breast neoplasms), and 48 (colon neoplasms) are successfully verified by two other databases. The experimental results proved that SMMDA has a reliable prediction ability in predicting potential miRNA-disease associations. Therefore, it is anticipated that SMMDA could be an effective tool for biomedical researchers.