Le Yang

Dr. Le Yang


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
14 January 2021 in Nature Computational Science
Verified
Journal Article
Closed access
PDF file
LYLe Yang
Le Yang
RCRunpu Chen
Runpu Chen
SGSteve Goodison
Steve Goodison
YSYijun Sun
Yijun Sun

14 August 2023 in Cancers
Verified
Journal Article
Open access
PDF file
LYLe Yang
Le Yang
RCRunpu Chen
Runpu Chen
TMThomas Melendy
Thomas Melendy
SGSteve Goodison
Steve Goodison
YSYijun Sun
Yijun Sun
Background: The identification of cancer driver genes and key molecular pathways has been the focus of large-scale cancer genome studies. Network-based methods detect significantly perturbed subnetworks as putative cancer pathways by incorporating genomics data with the topological information of PPI networks. However, commonly used PPI networks have distinct topological structures, making the results of the same method vary widely when applied to different networks. Furthermore, emerging context-specific PPI networks often have incomplete topological structures, which pose serious challenges for existing subnetwork detection algorithms. Methods: In this paper, we propose a novel method, referred to as MultiFDRnet, to address the above issues. The basic idea is to model a set of PPI networks as a multiplex network to preserve the topological structure of individual networks, while introducing dependencies among them, and, then, to detect significantly perturbed subnetworks on the modeled multiplex network using all the structural information simultaneously. Results: To illustrate the effectiveness of the proposed approach, an extensive benchmark analysis was conducted on both simulated and real cancer data. The experimental results showed that the proposed method is able to detect significantly perturbed subnetworks jointly supported by multiple PPI networks and to identify novel modular structures in context-specific PPI networks.

1 October 2024 in Cancer Research Communications
Verified
Journal Article
Open access
PDF file
RCRunpu Chen
Runpu Chen
LTLi Tang
Li Tang
TMThomas Melendy
Thomas Melendy
LYLe Yang
Le Yang
SGSteve Goodison
Steve Goodison
YSYijun Sun
Yijun Sun
Prostate cancer is a significant health concern and the most commonly diagnosed cancer in men worldwide. Understanding the complex process of prostate tumor evolution and progression is crucial for improved diagnosis, treatments, and patient outcomes. Previous studies have focused on unraveling the dynamics of prostate cancer evolution using phylogenetic or lineage analysis approaches. However, those approaches have limitations in capturing the complete disease process or incorporating genomic and transcriptomic variations comprehensively. In this study, we applied a novel computational approach to derive a prostate cancer progression model using multidimensional data from 497 prostate tumor samples and 52 tumor-adjacent normal samples obtained from The Cancer Genome Atlas study. The model was validated using data from an independent cohort of 545 primary tumor samples. By integrating transcriptomic and genomic data, our model provides a comprehensive view of prostate tumor progression, identifies crucial signaling pathways and genetic events, and uncovers distinct transcription signatures associated with disease progression. Our findings have significant implications for cancer research and hold promise for guiding personalized treatment strategies in prostate cancer. Significance: We developed and validated a progression model of prostate cancer using >1,000 tumor and normal tissue samples. The model provided a comprehensive view of prostate tumor evolution and progression.

21 October 2022 in Bioinformatics Advances
Verified
Journal Article
Open access
PDF file
JCJian Chen
Jian Chen
LYLe Yang
Le Yang
LLLu Li
Lu Li
SGSteve Goodison
Steve Goodison
YSYijun Sun
Yijun Sun
Quantifying pairwise sequence similarities is a key step in metagenomics studies. Alignment-free methods provide a computationally efficient alternative to alignment-based methods for large-scale sequence analysis. Several neural network-based methods have recently been developed for this purpose. However, existing methods do not perform well on sequences of varying lengths and are sensitive to the presence of insertions and deletions. In this article, we describe the development of a new method, referred to as AsMac that addresses the aforementioned issues. We proposed a novel neural network structure for approximate string matching for the extraction of pertinent information from biological sequences and developed an efficient gradient computation algorithm for training the constructed neural network. We performed a large-scale benchmark study using real-world data that demonstrated the effectiveness and potential utility of the proposed method. The open-source software for the proposed method and trained neural-network models for some commonly used metagenomics marker genes were developed and are freely available at www.acsu.buffalo.edu/~yijunsun/lab/AsMac.html. Supplementary data are available at Bioinformatics online.

27 May 2020 in bioRxiv
Verified
Preprint
Open access
PDF file
JCJian Chen
Jian Chen
LYLe Yang
Le Yang
LLLu Li
Lu Li
SGSteve Goodison
Steve Goodison
YSYijun Sun
Yijun Sun
Quantifying pairwise sequence similarities is a key step in metagenomics studies. Alignment-free methods provide a computationally efficient alternative to alignment-based methods for large-scale sequence analysis. Several neural network-based methods have recently been developed for this purpose. However, existing methods do not perform well on sequences of varying lengths and are sensitive to the presence of insertions and deletions. In this paper, we describe the development of a new method, referred to as AsMac, that addresses the aforementioned issues. We proposed a novel neural network structure for approximate string matching for the extraction of pertinent information from biological sequences and developed an efficient gradient computation algorithm for training the constructed neural network. We performed a large-scale benchmark study using real-world data that demonstrated the effectiveness and potential utility of the proposed method. The open-source software for the proposed method and trained neural-network models for some commonly used metagenomics marker genes were developed and are freely available at www.acsu.buffalo.edu/~yijunsun/lab/AsMac.html .