Demo Data from EDBT 2026 / reviewers in the wild / expert
Prashant S. Emani
dblp:358/6457
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-3091-5231ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021
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.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › drug discovery › drug design
computer-aided drug design |
0.7 | 1 | 2023 | Insights from incorporating quantum computing into drug design workflows · Bioinform. 2023 |
Bioinformatics and computational biology
immunoinformatics |
0.7 | 1 | 2023 | Binding peptide generation for MHC Class I proteins with deep reinforcement learning · Bioinform. 2023 |
Bioinformatics and computational biology › protein design
peptide generation |
0.7 | 1 | 2023 | Binding peptide generation for MHC Class I proteins with deep reinforcement learning · Bioinform. 2023 |
Bioinformatics and computational biology › immunoinformatics
TCR-epitope binding prediction |
0.7 | 1 | 2023 | Binding peptide generation for MHC Class I proteins with deep reinforcement learning · Bioinform. 2023 |
Bioinformatics and computational biology › statistical genetics
variant effect prediction |
0.7 | 1 | 2023 | Insights from incorporating quantum computing into drug design workflows · Bioinform. 2023 |
Methods — techniques the papers use, named apart from their topics
quantum machine learning · 0.7mutation policies · 0.7molecular dynamics · 0.7molecular docking · 0.7deep reinforcement learning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Binding peptide generation for MHC Class I proteins with deep reinforcement learningabstractMOTIVATION: MHC Class I protein plays an important role in immunotherapy by presenting immunogenic peptides to anti-tumor immune cells. The repertoires of peptides for various MHC Class I proteins are distinct, which can be reflected by their diverse binding motifs. To characterize binding motifs for MHC Class I proteins, in vitro experiments have been conducted to screen peptides with high binding affinities to hundreds of given MHC Class I proteins. However, considering tens of thousands of known MHC Class I proteins, conducting in vitro experiments for extensive MHC proteins is infeasible, and thus a more efficient and scalable way to characterize binding motifs is needed. RESULTS: We presented a de novo generation framework, coined PepPPO, to characterize binding motif for any given MHC Class I proteins via generating repertoires of peptides presented by them. PepPPO leverages a reinforcement learning agent with a mutation policy to mutate random input peptides into positive presented ones. Using PepPPO, we characterized binding motifs for around 10 000 known human MHC Class I proteins with and without experimental data. These computed motifs demonstrated high similarities with those derived from experimental data. In addition, we found that the motifs could be used for the rapid screening of neoantigens at a much lower time cost than previous deep-learning methods. AVAILABILITY AND IMPLEMENTATION: The software can be found in https://github.com/minrq/pMHC. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Baoyi Zhang, Prashant S. Emani, Trevor Clancy, Chongming Jiang, Mark Gerstein, Xia Ning, Martin Renqiang Min |
Bioinform. | 4 |
| 2023 | Insights from incorporating quantum computing into drug design workflowsabstractMOTIVATION: While many quantum computing (QC) methods promise theoretical advantages over classical counterparts, quantum hardware remains limited. Exploiting near-term QC in computer-aided drug design (CADD) thus requires judicious partitioning between classical and quantum calculations. RESULTS: We present HypaCADD, a hybrid classical-quantum workflow for finding ligands binding to proteins, while accounting for genetic mutations. We explicitly identify modules of our drug-design workflow currently amenable to replacement by QC: non-intuitively, we identify the mutation-impact predictor as the best candidate. HypaCADD thus combines classical docking and molecular dynamics with quantum machine learning (QML) to infer the impact of mutations. We present a case study with the coronavirus (SARS-CoV-2) protease and associated mutants. We map a classical machine-learning module onto QC, using a neural network constructed from qubit-rotation gates. We have implemented this in simulation and on two commercial quantum computers. We find that the QML models can perform on par with, if not better than, classical baselines. In summary, HypaCADD offers a successful strategy for leveraging QC for CADD. AVAILABILITY AND IMPLEMENTATION: Jupyter Notebooks with Python code are freely available for academic use on GitHub: https://www.github.com/hypahub/hypacadd_notebook. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Bayo Lau, Prashant S. Emani, Jackson Chapman, Lijing Yao, Tarsus Lam, Paul Merrill, Jonathan Warrell, Mark Gerstein, Hugo Y. K. Lam |
Bioinform. | 2 |