Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yoonjoo Choi

dblp:125/7593 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0001-9687-8093ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 2 first-authorSecurity and privacy · 2

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%
Network and information security
1 paper
Systems and software security · 100%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
protein design
0.312018
DisruPPI: structure-based computational redesign algorithm for protein binding disruption · Bioinform. 2018
Bioinformatics and computational biology
structural bioinformatics
0.312018
GradDock: rapid simulation and tailored ranking functions for peptide-MHC Class I docking · Bioinform. 2018
Bioinformatics and computational biology › statistical genetics
variant effect prediction
0.312018
DisruPPI: structure-based computational redesign algorithm for protein binding disruption · Bioinform. 2018
Systems and software security
software integrity
0.212013
Assessing software integrity of virtual appliances through software whitelists · NDSS 2013
Bioinformatics and computational biology
immunoinformatics
0.112018
GradDock: rapid simulation and tailored ranking functions for peptide-MHC Class I docking · Bioinform. 2018

Methods — techniques the papers use, named apart from their topics

steered gradient descent · 0.3software whitelisting · 0.3rosetta score terms · 0.3linear programming · 0.3foldx · 0.3INT5 · 0.3AMBER · 0.3
YearPublicationVenuePosition
2020 Computer-guided binding mode identification and affinity improvement of an LRR protein binder without structure determination
abstract
Precise binding mode identification and subsequent affinity improvement without structure determination remain a challenge in the development of therapeutic proteins. However, relevant experimental techniques are generally quite costly, and purely computational methods have been unreliable. Here, we show that integrated computational and experimental epitope localization followed by full-atom energy minimization can yield an accurate complex model structure which ultimately enables effective affinity improvement and redesign of binding specificity. As proof-of-concept, we used a leucine-rich repeat (LRR) protein binder, called a repebody (Rb), that specifically recognizes human IgG1 (hIgG1). We performed computationally-guided identification of the Rb:hIgG1 binding mode and leveraged the resulting model to reengineer the Rb so as to significantly increase its binding affinity for hIgG1 as well as redesign its specificity toward multiple IgGs from other species. Experimental structure determination verified that our Rb:hIgG1 model closely matched the co-crystal structure. Using a benchmark of other LRR protein complexes, we further demonstrated that the present approach may be broadly applicable to proteins undergoing relatively small conformational changes upon target binding.
Yoonjoo Choi, Sukyo Jeong, Jung-Min Choi, Christian NDong, Karl E. Griswold, Chris Bailey-Kellogg, Hak-Sung Kim
PLoS Comput. Biol.1
2018 DisruPPI: structure-based computational redesign algorithm for protein binding disruption
abstract
Motivation: Disruption of protein-protein interactions can mitigate antibody recognition of therapeutic proteins, yield monomeric forms of oligomeric proteins, and elucidate signaling mechanisms, among other applications. While designing affinity-enhancing mutations remains generally quite challenging, both statistically and physically based computational methods can precisely identify affinity-reducing mutations. In order to leverage this ability to design variants of a target protein with disrupted interactions, we developed the DisruPPI protein design method (DISRUpting Protein-Protein Interactions) to optimize combinations of mutations simultaneously for both disruption and stability, so that incorporated disruptive mutations do not inadvertently affect the target protein adversely. Results: Two existing methods for predicting mutational effects on binding, FoldX and INT5, were demonstrated to be quite precise in selecting disruptive mutations from the SKEMPI and AB-Bind databases of experimentally determined changes in binding free energy. DisruPPI was implemented to use an INT5-based disruption score integrated with an AMBER-based stability assessment and was applied to disrupt protein interactions in a set of different targets representing diverse applications. In retrospective evaluation with three different case studies, comparison of DisruPPI-designed variants to published experimental data showed that DisruPPI was able to identify more diverse interaction-disrupting and stability-preserving variants more efficiently and effectively than previous approaches. In prospective application to an interaction between enhanced green fluorescent protein (EGFP) and a nanobody, DisruPPI was used to design five EGFP variants, all of which were shown to have significantly reduced nanobody binding while maintaining function and thermostability. This demonstrates that DisruPPI may be readily utilized for effective removal of known epitopes of therapeutically relevant proteins. Availability and implementation: DisruPPI is implemented in the EpiSweep package, freely available under an academic use license. Supplementary information: Supplementary data are available at Bioinformatics online.
Yoonjoo Choi, Jacob M. Furlon, Ryan B. Amos, Karl E. Griswold, Chris Bailey-Kellogg
Bioinform.1
2018 GradDock: rapid simulation and tailored ranking functions for peptide-MHC Class I docking
abstract
Motivation: The identification of T-cell epitopes has many profound translational applications in the areas of transplantation, disease diagnosis, vaccine/therapeutic protein development and personalized immunotherapy. While data-driven methods have been widely used for the prediction of peptide binders with notable successes, the structural modeling of peptide binding to MHC molecules is crucial for understanding the underlying molecular mechanism of the immunological processes. Results: We developed GradDock, a structure-based method for the rapid and accurate modeling of peptide binding to MHC Class I (pMHC-I). GradDock explicitly models diverse unbound peptides in vacuo and inserts them into the MHC-I groove through a steered gradient descent with a topological correction process. The simulation process yields diverse structural conformations including native-like peptides. We completely revised the Rosetta score terms and developed a new ranking function specifically for pMHC-I. Using the diverse peptides, a linear programming approach is applied to find the optimal weights for the individual Rosetta score terms. Our examination revealed that a refinement of the dihedral angles and a modification of the repulsion can dramatically improve the modeling quality. GradDock is five-times faster than a Rosetta-based docking approach for pMHC-I. We also demonstrate that the predictive capability of GradDock with the re-weighted Rosetta ranking function is consistently more accurate than the Rosetta-based method with the standard Rosetta score (approximately three-times better for a cross-docking set). Availability and implementation: GradDock is freely available for academic purposes. The program and the ranking score weights for Rosetta are available at http://bel.kaist.ac.kr/research/GradDock. Contact: [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online.
Hyun-Ho Kyeong, Yoonjoo Choi, Hak-Sung Kim
Bioinform.2
2015 Mapping the Pareto Optimal Design Space for a Functionally Deimmunized Biotherapeutic Candidate
abstract
The immunogenicity of biotherapeutics can bottleneck development pipelines and poses a barrier to widespread clinical application. As a result, there is a growing need for improved deimmunization technologies. We have recently described algorithms that simultaneously optimize proteins for both reduced T cell epitope content and high-level function. In silico analysis of this dual objective design space reveals that there is no single global optimum with respect to protein deimmunization. Instead, mutagenic epitope deletion yields a spectrum of designs that exhibit tradeoffs between immunogenic potential and molecular function. The leading edge of this design space is the Pareto frontier, i.e. the undominated variants for which no other single design exhibits better performance in both criteria. Here, the Pareto frontier of a therapeutic enzyme has been designed, constructed, and evaluated experimentally. Various measures of protein performance were found to map a functional sequence space that correlated well with computational predictions. These results represent the first systematic and rigorous assessment of the functional penalty that must be paid for pursuing progressively more deimmunized biotherapeutic candidates. Given this capacity to rapidly assess and design for tradeoffs between protein immunogenicity and functionality, these algorithms may prove useful in augmenting, accelerating, and de-risking experimental deimmunization efforts.
Regina S. Salvat, Andrew S. Parker, Yoonjoo Choi, Chris Bailey-Kellogg, Karl E. Griswold
PLoS Comput. Biol.3
2013 An empirical study on the software integrity of virtual appliances: are you really getting what you paid for?
abstract
Virtual appliances (VAs) are ready-to-use virtual machine images that are configured for specific purposes. For example, a virtual machine image that contains all the software necessary to develop and host a JSP-based website is typically available as a "Java Web Starter" VA. Currently there are many VA repositories from which users can download VAs and instantiate them on Infrastructure-as-a-Service (IaaS) clouds, allowing them to quickly launch their services. This marketplace, however, lacks adequate mechanisms that allow users to a priori assess whether a specific VA is really configured with the software that it is expected to be configured with. This paper evaluates the integrity of software packages installed on real-world VAs, through the use of a software whitelist-based framework, and finds that indeed there is a lot of variance in the software integrity of packages across VAs. Analysis of 151 Amazon VAs using this framework shows that about 9% of real-world VAs have significant numbers of software packages that contain unknown files, making them potentially untrusted. Virus scanners flagged just half of the VAs in that 9% as malicious, demonstrating that virus scanning alone is not sufficient to help users select a trustable VA and that a priori software integrity assessment has a role to play.
Jun-Ho Huh, Mirko Montanari, Derek Dagit, Rakesh Bobba, Yoonjoo Choi, Roy H. Campbell
AsiaCCS6
2013 Assessing software integrity of virtual appliances through software whitelists
Jun-Ho Huh, Mirko Montanari, Derek Dagit, Rakesh Bobba, Yoonjoo Choi, Roy H. Campbell
NDSS6