Demo Data from VLDB 2026 / reviewers in the wild / expert
Yibing Shan
dblp:43/1200
· DBLP profile ↗
8ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0002-3865-8110ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 6 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
6 papers |
High-performance computing · 83% Hardware accelerators and domain-specific architectures · 11% Parallel and multicore computing · 5% | |
| Interdisciplinary, comprehensive, and emerging computing
4 papers |
Bioinformatics and computational biology · 96% Computational science and engineering · 4% |
Topics — the 14 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
drug discovery |
0.9 | 1 | 2025 | Trillion Ligands per Day: Performance-Portable Virtual Screening via Compound Database Optimization and Multi-Target Docking · SC 2025 |
Bioinformatics and computational biology › molecular informatics › molecular modeling
molecular docking |
0.9 | 1 | 2025 | Trillion Ligands per Day: Performance-Portable Virtual Screening via Compound Database Optimization and Multi-Target Docking · SC 2025 |
High-performance computing › scientific computing systems
molecular dynamics simulation |
0.4 | 5 | 2009 | Millisecond-scale molecular dynamics simulations on Anton · SC 2009 Millisecond-scale molecular dynamics simulations on Anton · SC 2009 High-throughput pairwise point interactions in Anton, a specialized machine for molecular dynamics simulation · HPCA 2008 |
High-performance computing
scientific computing systems |
0.4 | 5 | 2009 | Millisecond-scale molecular dynamics simulations on Anton · SC 2009 Millisecond-scale molecular dynamics simulations on Anton · SC 2009 High-throughput pairwise point interactions in Anton, a specialized machine for molecular dynamics simulation · HPCA 2008 |
High-performance computing › supercomputer architecture
sunway architecture |
0.3 | 1 | 2025 | Trillion Ligands per Day: Performance-Portable Virtual Screening via Compound Database Optimization and Multi-Target Docking · SC 2025 |
Hardware accelerators and domain-specific architectures › scientific computing accelerator
molecular dynamics accelerator |
0.2 | 2 | 2009 | Millisecond-scale molecular dynamics simulations on Anton · SC 2009 Millisecond-scale molecular dynamics simulations on Anton · SC 2009 |
Parallel and multicore computing › parallelization strategies
parallel decomposition |
0.1 | 1 | 2006 | Molecular dynamics - Scalable algorithms for molecular dynamics simulations on commodity clusters · SC 2006 |
Parallel and multicore computing
parallel programming models and runtimes |
0.1 | 1 | 2006 | Molecular dynamics - Scalable algorithms for molecular dynamics simulations on commodity clusters · SC 2006 |
High-performance computing › performance optimization at scale
parallel scalability |
0.1 | 1 | 2006 | Molecular dynamics - Scalable algorithms for molecular dynamics simulations on commodity clusters · SC 2006 |
High-performance computing
performance optimization at scale |
0.1 | 1 | 2006 | Molecular dynamics - Scalable algorithms for molecular dynamics simulations on commodity clusters · SC 2006 |
Bioinformatics and computational biology › molecular informatics › molecular modeling
biomolecular simulation |
0.1 | 2 | 2009 | Millisecond-scale molecular dynamics simulations on Anton · SC 2009 Millisecond-scale molecular dynamics simulations on Anton · SC 2009 |
Computational science and engineering › computational chemistry
molecular simulation |
0.1 | 2 | 2009 | Millisecond-scale molecular dynamics simulations on Anton · SC 2009 Millisecond-scale molecular dynamics simulations on Anton · SC 2009 |
Interconnection networks and networks-on-chip › die-to-die interconnect
inter-chip communication |
0.0 | 1 | 2008 | High-throughput pairwise point interactions in Anton, a specialized machine for molecular dynamics simulation · HPCA 2008 |
Computational science and engineering › computational chemistry › molecular simulation
molecular dynamics |
0.0 | 1 | 2007 | Anton, a special-purpose machine for molecular dynamics simulation · ISCA 2007 |
Methods — techniques the papers use, named apart from their topics
trilinear interpolation · 1.7performance portability · 1.7SIMD · 1.7co-design · 0.4application-specific hardware · 0.4parallelization algorithm for range-limited n-body problem · 0.1vector instructions · 0.1single-precision computation · 0.1message passing · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Trillion Ligands per Day: Performance-Portable Virtual Screening via Compound Database Optimization and Multi-Target DockingabstractStructure-based virtual screening confronts a grand challenge in scaling to trillion-ligand libraries for drug discovery. We present SWDOCKP2, a performance-portable virtual screening framework achieving 1.9 trillion ligand-receptor pairs daily across eight targets on the Sunway OceanLight supercomputer with 39-million cores — 10× faster than prior state-of-the-art. Key innovations combine (1) a ligand database optimizer with conformational sorting and merging, (2) multi-receptor grid alignment enabling parallel target screening and SIMD-accelerated trilinear interpolation, and (3) a Sunway architecture emulator for cross-platform efficiency. These advancements bridge computational scalability with novel drug discovery demands, offering a blueprint for next-generation supercomputing in structure-based drug design. Additionally, SWDOCKP2 will generate an unprecedented dataset of predicted protein-ligand interactions, creating a transformative resource for machine learning applications. By addressing experimental data scarcity, this dataset empowers accurate ligand prediction, generative chemistry, and AI-driven drug discovery. Xiaohui Duan, Gaowei Chen, Yizhen Chen, Qixin Chang, Qiancheng Xia, Zekun Yin, Lin Gan 0001, Yibing Shan, Guangwen Yang 0002, Niu Huang |
SC | 11 |
| 2022 | How does a small molecule bind at a cryptic binding site?abstractProtein-protein interactions (PPIs) are ubiquitous biomolecular processes that are central to virtually all aspects of cellular function. Identifying small molecules that modulate specific disease-related PPIs is a strategy with enormous promise for drug discovery. The design of drugs to disrupt PPIs is challenging, however, because many potential drug-binding sites at PPI interfaces are "cryptic": When unoccupied by a ligand, cryptic sites are often flat and featureless, and thus not readily recognizable in crystal structures, with the geometric and chemical characteristics of typical small-molecule binding sites only emerging upon ligand binding. The rational design of small molecules to inhibit specific PPIs would benefit from a better understanding of how such molecules bind at PPI interfaces. To this end, we have conducted unbiased, all-atom MD simulations of the binding of four small-molecule inhibitors (SP4206 and three SP4206 analogs) to interleukin 2 (IL2)-which performs its function by forming a PPI with its receptor-without incorporating any prior structural information about the ligands' binding. In multiple binding events, a small molecule settled into a stable binding pose at the PPI interface of IL2, resulting in a protein-small-molecule binding site and pose virtually identical to that observed in an existing crystal structure of the IL2-SP4206 complex. Binding of the small molecule stabilized the IL2 binding groove, which when the small molecule was not bound emerged only transiently and incompletely. Moreover, free energy perturbation (FEP) calculations successfully distinguished between the native and non-native IL2-small-molecule binding poses found in the simulations, suggesting that binding simulations in combination with FEP may provide an effective tool for identifying cryptic binding sites and determining the binding poses of small molecules designed to disrupt PPI interfaces by binding to such sites. Yibing Shan, Venkatesh P. Mysore, Abba E. Leffler, Eric T. Kim, Shiori Sagawa, David E. Shaw |
PLoS Comput. Biol. | 1 |
| 2014 | Membrane Interaction of Bound Ligands Contributes to the Negative Binding Cooperativity of the EGF ReceptorabstractThe epidermal growth factor receptor (EGFR) plays a key role in regulating cell proliferation, migration, and differentiation, and aberrant EGFR signaling is implicated in a variety of cancers. EGFR signaling is triggered by extracellular ligand binding, which promotes EGFR dimerization and activation. Ligand-binding measurements are consistent with a negatively cooperative model in which the ligand-binding affinity at either binding site in an EGFR dimer is weaker when the other site is occupied by a ligand. This cooperativity is widely believed to be central to the effects of ligand concentration on EGFR-mediated intracellular signaling. Although the extracellular portion of the human EGFR dimer has been resolved crystallographically, the crystal structures do not reveal the structural origin of this negative cooperativity, which has remained unclear. Here we report the results of molecular dynamics simulations suggesting that asymmetrical interactions of the two binding sites with the membrane may be responsible (perhaps along with other factors) for this negative cooperativity. In particular, in our simulations the extracellular domains of an EGFR dimer spontaneously lay down on the membrane in an orientation in which favorable membrane contacts were made with one of the bound ligands, but could not be made with the other. Similar interactions were observed when EGFR was glycosylated, as it is in vivo. Anton Arkhipov, Yibing Shan, Eric T. Kim, David E. Shaw |
PLoS Comput. Biol. | 2 |
| 2009 | Millisecond-scale molecular dynamics simulations on AntonabstractAnton is a recently completed special-purpose supercomputer designed for molecular dynamics (MD) simulations of biomolecular systems. The machine's specialized hardware dramatically increases the speed of MD calculations, making possible for the first time the simulation of biological molecules at an atomic level of detail for periods on the order of a millisecond---about two orders of magnitude beyond the previous state of the art. Anton is now running simulations on a timescale at which many critically important, but poorly understood phenomena are known to occur, allowing the observation of aspects of protein dynamics that were previously inaccessible to both computational and experimental study. Here, we report Anton's performance when executing actual MD simulations whose accuracy has been validated against both existing MD software and experimental observations. We also discuss the manner in which novel algorithms have been coordinated with Anton's co-designed, application-specific hardware to achieve these results. David E. Shaw, Ron O. Dror, John K. Salmon, J. P. Grossman, Kenneth M. Mackenzie, Joseph A. Bank, Cliff Young, Martin M. Deneroff, Brannon Batson, Kevin J. Bowers, Edmond Chow, Michael P. Eastwood, Doug Ierardi, John L. Klepeis, Jeffrey Kuskin, Richard H. Larson, Kresten Lindorff-Larsen, Paul Maragakis, Mark A. Moraes, Stefano Piana, Yibing Shan, Brian Towles |
SC | 21 |
| 2009 | Millisecond-scale molecular dynamics simulations on AntonabstractAnton is a recently completed special-purpose supercomputer designed for molecular dynamics (MD) simulations of biomolecular systems. The machine's specialized hardware dramatically increases the speed of MD calculations, making possible for the first time the simulation of biological molecules at an atomic level of detail for periods on the order of a millisecond---about two orders of magnitude beyond the previous state of the art. Anton is now running simulations on a timescale at which many critically important, but poorly understood phenomena are known to occur, allowing the observation of aspects of protein dynamics that were previously inaccessible to both computational and experimental study. Here, we report Anton's performance when executing actual MD simulations whose accuracy has been validated against both existing MD software and experimental observations. We also discuss the manner in which novel algorithms have been coordinated with Anton's co-designed, application-specific hardware to achieve these results. David E. Shaw, Ron O. Dror, John K. Salmon, J. P. Grossman, Kenneth M. Mackenzie, Joseph A. Bank, Cliff Young, Martin M. Deneroff, Brannon Batson, Kevin J. Bowers, Edmond Chow, Michael P. Eastwood, Doug Ierardi, John L. Klepeis, Jeffrey Kuskin, Richard H. Larson, Kresten Lindorff-Larsen, Paul Maragakis, Mark A. Moraes, Stefano Piana, Yibing Shan, Brian Towles |
SC | 21 |
| 2008 | High-throughput pairwise point interactions in Anton, a specialized machine for molecular dynamics simulationabstractAnton is a massively parallel special-purpose supercomputer designed to accelerate molecular dynamics (MD) simulations by several orders of magnitude, making possible for the first time the atomic-level simulation of many biologically important phenomena that take place over microsecond to millisecond time scales. The majority of the computation required for MD simulations involves the calculation of pairwise interactions between particles and/or gridpoints separated by no more than some specified cutoff radius. In Anton, such range-limited interactions are handled by a high-throughput interaction subsystem (HTIS). The HTIS on each of Antonpsilas 512 ASICs includes 32 computational pipelines running at 800 MHz, each producing a result on every cycle that would require approximately 50 arithmetic operations to compute on a general-purpose processor. In order to feed these pipelines and collect their results at a speed sufficient to take advantage of this computational power, Anton uses two novel techniques to limit inter- and intra-chip communication. The first is a recently developed parallelization algorithm for the range-limited N-body problem that offers major advantages in both asymptotic and absolute terms by comparison with traditional methods. The second is an architectural feature that processes pairs of points chosen from two point sets in time proportional to the product of the sizes of those sets, but with input and output volume proportional only to their sum. Together, these features allow Anton to perform pairwise interactions with very high throughput and unusually low latency, enabling MD simulations on time scales inaccessible to other general- and special-purpose parallel systems. Richard H. Larson, John K. Salmon, Ron O. Dror, Martin M. Deneroff, Cliff Young, J. P. Grossman, Yibing Shan, John L. Klepeis, David E. Shaw |
HPCA | 7 |
| 2007 | Anton, a special-purpose machine for molecular dynamics simulationabstractThe ability to perform long, accurate molecular dynamics (MD) simulations involving proteins and other biological macro-molecules could in principle provide answers to some of the most important currently outstanding questions in the fields of biology, chemistry and medicine. A wide range of biologically interesting phenomena, however, occur over time scales on the order of a millisecond--about three orders of magnitude beyond the duration of the longest current MD simulations. David E. Shaw, Martin M. Deneroff, Ron O. Dror, Jeffrey Kuskin, Richard H. Larson, John K. Salmon, Cliff Young, Brannon Batson, Kevin J. Bowers, Jack C. Chao, Michael P. Eastwood, Joseph Gagliardo, J. P. Grossman, Richard Ho 0001, Doug Ierardi, István Kolossváry, John L. Klepeis, Timothy Layman, Christine McLeavey, Mark A. Moraes, Edward C. Priest, Yibing Shan, Jochen Spengler, Michael Theobald, Brian Towles, Stanley C. Wang |
ISCA | 23 |
| 2006 | Molecular dynamics - Scalable algorithms for molecular dynamics simulations on commodity clustersabstractAlthough molecular dynamics (MD) simulations of biomolecular systems often run for days to months, many events of great scientific interest and pharmaceutical relevance occur on long time scales that remain beyond reach. We present several new algorithms and implementation techniques that significantly accelerate parallel MD simulations compared with current state-of-the-art codes. These include a novel parallel decomposition method and message-passing techniques that reduce communication requirements, as well as novel communication primitives that further reduce communication time. We have also developed numerical techniques that maintain high accuracy while using single precision computation in order to exploit processor-level vector instructions. These methods are embodied in a newly developed MD code called Desmond that achieves unprecedented simulation throughput and parallel scalability on commodity clusters. Our results suggest that Desmond's parallel performance substantially surpasses that of any previously described code. For example, on a standard benchmark, Desmond's performance on a conventional Opteron cluster with 2K processors slightly exceeded the reported performance of IBM's Blue Gene/L machine with 32K processors running its Blue Matter MD code. Kevin J. Bowers, Edmond Chow, Huafeng Xu, Ron O. Dror, Michael P. Eastwood, Brent A. Gregersen, John L. Klepeis, István Kolossváry, Mark A. Moraes, Federico D. Sacerdoti, John K. Salmon, Yibing Shan, David E. Shaw |
SC | 12 |