Yihang Shen

Yihang Shen

Auto-generated profile, based on publicly available information

Yihang Shen

School of Computer Science, Carnegie Mellon University

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
3 May 2017 in Nucleic Acids Research
Verified
Journal Article
Open access
PDF file
XWXia Wang
Xia Wang
YSYihang Shen
Yihang Shen
SWShiwei Wang
Shiwei Wang
SLShiliang Li
Shiliang Li
WZWeilin Zhang
Weilin Zhang
HLHonglin Li
Honglin Li
The PharmMapper online tool is a web server for potential drug target identification by reversed pharmacophore matching the query compound against an in-house pharmacophore model database. The original version of PharmMapper includes more than 7000 target pharmacophores derived from complex crystal structures with corresponding protein target annotations. In this article, we present a new version of the PharmMapper web server, of which the backend pharmacophore database is six times larger than the earlier one, with a total of 23 236 proteins covering 16 159 druggable pharmacophore models and 51 431 ligandable pharmacophore models. The expanded target data cover 450 indications and 4800 molecular functions compared to 110 indications and 349 molecular functions in our last update. In addition, the new web server is united with the statistically meaningful ranking of the identified drug targets, which is achieved through the use of standard scores. It also features an improved user interface. The proposed web server is freely available at http://lilab.ecust.edu.cn/pharmmapper/.

10 May 2018 in Nucleic Acids Research
Verified
Journal Article
Open access
PDF file
YXYoujun Xu
Youjun Xu
SWShiwei Wang
Shiwei Wang
QHQiwan Hu
Qiwan Hu
SGShuaishi Gao
Shuaishi Gao
XMXiaomin Ma
Xiaomin Ma
JPJianfeng Pei
Jianfeng Pei
CavityPlus is a web server that offers protein cavity detection and various functional analyses. Using protein three-dimensional structural information as the input, CavityPlus applies CAVITY to detect potential binding sites on the surface of a given protein structure and rank them based on ligandability and druggability scores. These potential binding sites can be further analysed using three submodules, CavPharmer, CorrSite, and CovCys. CavPharmer uses a receptor-based pharmacophore modelling program, Pocket, to automatically extract pharmacophore features within cavities. CorrSite identifies potential allosteric ligand-binding sites based on motion correlation analyses between cavities. CovCys automatically detects druggable cysteine residues, which is especially useful to identify novel binding sites for designing covalent allosteric ligands. Overall, CavityPlus provides an integrated platform for analysing comprehensive properties of protein binding cavities. Such analyses are useful for many aspects of drug design and discovery, including target selection and identification, virtual screening, de novo drug design, and allosteric and covalent-binding drug design. The CavityPlus web server is freely available at http://repharma.pku.edu.cn/cavityplus or http://www.pkumdl.cn/cavityplus.

18 April 2025 in bioRxiv
Verified
Preprint
Open access
PDF file
HTHaotian Teng
Haotian Teng
RWRan Wang
Ran Wang
YSYihang Shen
Yihang Shen
YYYe Yuan
Ye Yuan
CKCarl Kingsford
Carl Kingsford
In computational chemistry, molecular docking—predicting the binding structure of a small molecule ligand to a protein—is vital for understanding interactions between small molecules and their protein targets, with broad applications in drug discovery (Morris and Lim-Wilby, 2008). Traditional docking methods rely on energy-based scoring functions and optimization algorithms to identify ligand-binding structures. However, these methods are often slow and inaccurate due to the extensive search space for binding structures and the complexity of scoring function landscapes (Corso et al., 2023). Deep learning techniques have emerged as promising alternatives for molecular docking. These methods harness the power of neural networks to understand the complex interactions between protein pockets and ligands from large datasets. They can be classified into two categories: regression-based methods (Stark et al., 2022; Lu et al., 2022), which offer greater computational efficiency compared to traditional docking methods but have yet to offer substantial improvements in accuracy (Corso et al., 2023); and generative models, particularly diffusion models (Corso et al., 2023; Qiao et al., 2024; Nakata et al., 2023; Lu et al., 2024; Schneuing et al., 2024), which lead to significant accuracy improvements compared to regression-based methods. Most diffusion-based docking methods aim to address the blind docking problem, where the ligand is docked without prior knowledge of the specific protein pocket—a site of the protein with potential ligand-binding capabilities—and only the overall protein structure is provided (Yim et al., 2024). However, in many drug discovery cases, specific pockets have already been identified (Zheng et al., 2013), meaning that the docking process only needs to determine how the ligand binds to the pocket. This defines the pocket-based docking problem. Pocket-based docking leverages the physical and chemical information of protein side chains around the pocket, significantly reducing the search space for ligand binding structures and improving the understanding of atomic-level interactions. Additionally, focusing on the local protein substructure rather than the global structure enhances computational efficiency, which allows for the use of more complex neural architectures. We introduce DTMol, a novel diffusion model designed to tackle the pocket-based docking problem. Our model integrates a pretrained molecular representation framework with a diffusion transformer architecture. The advantages of this design are twofold: first, the molecular representation models we employ are pretrained on separate datasets of small molecules and protein pockets, which are larger than the datasets of ligand-pocket interactions. Consequently, these pretrained models encode typical structural features of both elements, enhancing our model’s ability to represent them and predict binding structures. Second, the transformer architecture used in our diffusion model is more capable of effectively capturing all-atom interactions between the pocket and the ligand. We test our method on the docking benchmark PDBBind v2020 and PoseBuster, and compare it with other methods. DTMol achieves 77.65% top-1 success rate (RMSD ¡ 2Å) on PoseBuster, outperforms the second-best docking software Gnina (65.65%) We also test the performance of our method on a real-world virtual screening task using Janus kinase 2 (PDB ID: 6BBV) as the target protein. A TR-FRET screening experiment is performed on the union of top ligands identified via physics-based docking and the diffusion model, in order to measure their inhibitory activity against the JAK2 protein. The results shows that our model achieved the only positive rank correlation score compared to other traditional docking methods and machine learning-based methods. To summarize, the main contributions of this work are: - We introduce DTMol, a novel diffusion model designed to address the pocket-based docking problem. This model represents the first application of the diffusion transformer architecture in solving pocket-based molecular docking. - We propose a novel SE(3)-equivariant transformer architecture with an SE(3)-invariant and a parallel SE(3)-equivariant flow, which is straightforward to implement and train while achieving excellent performance. - We achieve new state-of-the-art results on both the PDBBind and PoseBuster pocket-based docking benchmarks, obtaining top-1 prediction rates of 45.05% and 77.65%, respectively, at RMSD < 2Å. - Doing virtual screening on Janus kinase 2, DTMol is able to achieve the only positive rank score; and identifies 2 new experimentally effective JAK2 inhibitors.

12 November 2023 in bioRxiv
Verified
Preprint
Open access
PDF file
YSYihang Shen
Yihang Shen
LYLingge Yu
Lingge Yu
YQYutong Qiu
Yutong Qiu
TZTianyu Zhang
Tianyu Zhang
CKCarl Kingsford
Carl Kingsford
Three-dimensional chromosome structure plays an important role in fundamental genomic functions. Hi-C, a high-throughput, sequencing-based technique, has drastically expanded our comprehension of 3D chromosome structures. The first step of Hi-C analysis pipeline involves mapping sequencing reads from Hi-C to linear reference genomes. However, the linear reference genome does not incorporate genetic variation information, which can lead to incorrect read alignments, especially when analyzing samples with substantial genomic differences from the reference such as cancer samples. Using genome graphs as the reference facilitates more accurate mapping of reads, however, new algorithms are required for inferring linear genomes from Hi-C reads mapped on genome graphs and constructing corresponding Hi-C contact matrices, which is a prerequisite for the subsequent steps of the Hi-C analysis such as identifying topologically associated domains and calling chromatin loops. We introduce the problem of genome sequence inference from Hi-C data mediated by genome graphs. We formalize this problem, show the hardness of solving this problem, and introduce a novel heuristic algorithm specifically tailored to this problem. We provide a theoretical analysis to evaluate the efficacy of our algorithm. Finally, our empirical experiments indicate that the linear genomes inferred from our method lead to the creation of improved Hi-C contact matrices. These enhanced matrices show a reduction in erroneous patterns caused by structural variations and are more effective in accurately capturing the structures of topologically associated domains.

30 January 2024 in bioRxiv
Verified
Preprint
Open access
PDF file
YSYihang Shen
Yihang Shen
ZYZhiwen Yan
Zhiwen Yan
CKCarl Kingsford
Carl Kingsford
Motivation Transcript assemblers are tools to reconstruct expressed transcripts from RNA-seq data. These tools have a large number of tunable parameters, and accurate transcript assembly requires setting them suitably. Because of the heterogeneity of different RNA-seq samples, a single default setting or a small fixed set of parameter candidates can only support the good performance of transcript assembly on average, but are often suboptimal for many individual samples. Manually tuning parameters for each sample is extremely time consuming and requires specialized experience. Therefore, developing an automated system that can advise good parameter settings for individual samples becomes an important problem. Results Using Bayesian optimization and contrastive learning, we develop a new automated parameter advising system for transcript assembly that can generate sets of sample-specific parameter candidates. Our framework achieves efficient sample-specific parameter advising by learning parameter knowledge from a large representative set of existing RNA-seq samples and transferring the knowledge to unseen samples. We use Scallop and StringTie, two well-known transcript assemblers, to test our framework on two collections of RNA-seq samples. Results show that our new parameter advising system significantly outperforms the previous advising method in each dataset and each transcript assembler. The source code to reproduce the results from this study can be found at https://github.com/Kingsford-Group/autoparadvisor.