Hyung Rae Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hyung Rae Kim has a total of 157 co-authors. Here are the top co-authors by number of shared publications:
- Daisuke Kihara
Department of Biological Sciences, Purdue University, West Lafayette, IN 47906, USA
5 shared publications Daisuke Kihara
Department of Biological Sciences, Purdue University, West Lafayette, Indiana, 47907
3 shared publicationsLenna X. Peterson
Department of Biological Sciences, Purdue University, West Lafayette, Indiana
3 shared publicationsJuan Esquivel‐Rodriguez
Department of Computer Science, Purdue University, West Lafayette, Indiana
2 shared publicationsSoo Yong Kim
2 shared publicationsWoong‐Hee Shin
Department of Biological Sciences, Purdue University, West Lafayette, Indiana
2 shared publications
Latest Publications
- 24 October 2023
- Published by Springer Nature in Journal of the Korean Physical Society
- Vol. 83 (10) , 814-827
Characteristics of ceaselessly generable biological time series
- 24 October 2023
- Published by Springer Nature in Journal of the Korean Physical Society
- Vol. 83 (10) , 814-827
Characteristics of ceaselessly generable biological time series
- 2 August 2021
- Published by Springer Nature in Journal of the Korean Physical Society
- Vol. 79 (4) , 412-427
A model of artificial biological time series generation
- 2 August 2021
- Published by Springer Nature in Journal of the Korean Physical Society
- Vol. 79 (4) , 412-427
A model of artificial biological time series generation
- 1 August 2018
- Published by Korean Physical Society in Journal of the Korean Physical Society
- Vol. 73 (3) , 377-387
Discrimination of Mild Alzheimer's Disease Patients using Cluster Analysis of Information Transmission in EEG
A description method of information transmission was presented and applied to EEGs recorded from groups of mild Alzheimer's disease (AD) patients and normal controls. To monitor the general interdependence of EEG channels, time-delayed mutual information was computed using the Fraser- Swinney algorithm. To manage the stochastic nature of mutual information and global connectivity of the brain, the modified Karhunen-Loeve decomposition (information transmission map: ITM), which was conducted as a quantification method of the resulting stochastic mutual information, was used. The integration of mutual information with Omega complexity elevated the discrimination power for mild AD. This provides a good procedure, capable of capturing the fine structure in the global information transmission between brain parts, compared with mutual information calculation alone. Compared with normal aged controls, mild AD patients showed significantly different short-time clustered behavior in the information transmission from the EEG. They also show a peculiar pattern of information flows from the successive snapshot monitoring. The observations suggest a discrimination of the mild AD patients from the normal aged controls.
- 1 August 2018
- Published by Korean Physical Society in Journal of the Korean Physical Society
- Vol. 73 (3) , 377-387
Discrimination of Mild Alzheimer's Disease Patients using Cluster Analysis of Information Transmission in EEG
A description method of information transmission was presented and applied to EEGs recorded from groups of mild Alzheimer's disease (AD) patients and normal controls. To monitor the general interdependence of EEG channels, time-delayed mutual information was computed using the Fraser- Swinney algorithm. To manage the stochastic nature of mutual information and global connectivity of the brain, the modified Karhunen-Loeve decomposition (information transmission map: ITM), which was conducted as a quantification method of the resulting stochastic mutual information, was used. The integration of mutual information with Omega complexity elevated the discrimination power for mild AD. This provides a good procedure, capable of capturing the fine structure in the global information transmission between brain parts, compared with mutual information calculation alone. Compared with normal aged controls, mild AD patients showed significantly different short-time clustered behavior in the information transmission from the EEG. They also show a peculiar pattern of information flows from the successive snapshot monitoring. The observations suggest a discrimination of the mild AD patients from the normal aged controls.
- 28 August 2017
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 86 (S1) , 311-320
Improved performance in CAPRI round 37 using LZerD docking and template‐based modeling with combined scoring functions
We report our group's performance for protein‐protein complex structure prediction and scoring in Round 37 of the Critical Assessment of PRediction of Interactions (CAPRI), an objective assessment of protein‐protein complex modeling. We demonstrated noticeable improvement in both prediction and scoring compared to previous rounds of CAPRI, with our human predictor group near the top of the rankings and our server scorer group at the top. This is the first time in CAPRI that a server has been the top scorer group. To predict protein‐protein complex structures, we used both multi‐chain template‐based modeling (TBM) and our protein‐protein docking program, LZerD. LZerD represents protein surfaces using 3D Zernike descriptors (3DZD), which are based on a mathematical series expansion of a 3D function. Because 3DZD are a soft representation of the protein surface, LZerD is tolerant to small conformational changes, making it well suited to docking unbound and TBM structures. The key to our improved performance in CAPRI Round 37 was to combine multi‐chain TBM and docking. As opposed to our previous strategy of performing docking for all target complexes, we used TBM when multi‐chain templates were available and docking otherwise. We also describe the combination of multiple scoring functions used by our server scorer group, which achieved the top rank for the scorer phase.
- 28 August 2017
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 86 (S1) , 311-320
Improved performance in CAPRI round 37 using LZerD docking and template‐based modeling with combined scoring functions
We report our group's performance for protein‐protein complex structure prediction and scoring in Round 37 of the Critical Assessment of PRediction of Interactions (CAPRI), an objective assessment of protein‐protein complex modeling. We demonstrated noticeable improvement in both prediction and scoring compared to previous rounds of CAPRI, with our human predictor group near the top of the rankings and our server scorer group at the top. This is the first time in CAPRI that a server has been the top scorer group. To predict protein‐protein complex structures, we used both multi‐chain template‐based modeling (TBM) and our protein‐protein docking program, LZerD. LZerD represents protein surfaces using 3D Zernike descriptors (3DZD), which are based on a mathematical series expansion of a 3D function. Because 3DZD are a soft representation of the protein surface, LZerD is tolerant to small conformational changes, making it well suited to docking unbound and TBM structures. The key to our improved performance in CAPRI Round 37 was to combine multi‐chain TBM and docking. As opposed to our previous strategy of performing docking for all target complexes, we used TBM when multi‐chain templates were available and docking otherwise. We also describe the combination of multiple scoring functions used by our server scorer group, which achieved the top rank for the scorer phase.
- 21 September 2016
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 85 (3) , 513-527
Human and server docking prediction for CAPRI round 30‐35 using LZerD with combined scoring functions
We report the performance of protein–protein docking predictions by our group for recent rounds of the Critical Assessment of Prediction of Interactions (CAPRI), a community‐wide assessment of state‐of‐the‐art docking methods. Our prediction procedure uses a protein–protein docking program named LZerD developed in our group. LZerD represents a protein surface with 3D Zernike descriptors (3DZD), which are based on a mathematical series expansion of a 3D function. The appropriate soft representation of protein surface with 3DZD makes the method more tolerant to conformational change of proteins upon docking, which adds an advantage for unbound docking. Docking was guided by interface residue prediction performed with BindML and cons‐PPISP as well as literature information when available. The generated docking models were ranked by a combination of scoring functions, including PRESCO, which evaluates the native‐likeness of residues' spatial environments in structure models. First, we discuss the overall performance of our group in the CAPRI prediction rounds and investigate the reasons for unsuccessful cases. Then, we examine the performance of several knowledge‐based scoring functions and their combinations for ranking docking models. It was found that the quality of a pool of docking models generated by LZerD, that is whether or not the pool includes near‐native models, can be predicted by the correlation of multiple scores. Although the current analysis used docking models generated by LZerD, findings on scoring functions are expected to be universally applicable to other docking methods. Proteins 2017; 85:513–527.
- 21 September 2016
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 85 (3) , 513-527
Human and server docking prediction for CAPRI round 30‐35 using LZerD with combined scoring functions
We report the performance of protein–protein docking predictions by our group for recent rounds of the Critical Assessment of Prediction of Interactions (CAPRI), a community‐wide assessment of state‐of‐the‐art docking methods. Our prediction procedure uses a protein–protein docking program named LZerD developed in our group. LZerD represents a protein surface with 3D Zernike descriptors (3DZD), which are based on a mathematical series expansion of a 3D function. The appropriate soft representation of protein surface with 3DZD makes the method more tolerant to conformational change of proteins upon docking, which adds an advantage for unbound docking. Docking was guided by interface residue prediction performed with BindML and cons‐PPISP as well as literature information when available. The generated docking models were ranked by a combination of scoring functions, including PRESCO, which evaluates the native‐likeness of residues' spatial environments in structure models. First, we discuss the overall performance of our group in the CAPRI prediction rounds and investigate the reasons for unsuccessful cases. Then, we examine the performance of several knowledge‐based scoring functions and their combinations for ranking docking models. It was found that the quality of a pool of docking models generated by LZerD, that is whether or not the pool includes near‐native models, can be predicted by the correlation of multiple scores. Although the current analysis used docking models generated by LZerD, findings on scoring functions are expected to be universally applicable to other docking methods. Proteins 2017; 85:513–527.
- Open Access
- 28 April 2016
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 84 (S1) , 323-348
Prediction of homoprotein and heteroprotein complexes by protein docking and template‐based modeling: A CASP‐CAPRI experiment
We present the results for CAPRI Round 30, the first joint CASP‐CAPRI experiment, which brought together experts from the protein structure prediction and protein–protein docking communities. The Round comprised 25 targets from amongst those submitted for the CASP11 prediction experiment of 2014. The targets included mostly homodimers, a few homotetramers, and two heterodimers, and comprised protein chains that could readily be modeled using templates from the Protein Data Bank. On average 24 CAPRI groups and 7 CASP groups submitted docking predictions for each target, and 12 CAPRI groups per target participated in the CAPRI scoring experiment. In total more than 9500 models were assessed against the 3D structures of the corresponding target complexes. Results show that the prediction of homodimer assemblies by homology modeling techniques and docking calculations is quite successful for targets featuring large enough subunit interfaces to represent stable associations. Targets with ambiguous or inaccurate oligomeric state assignments, often featuring crystal contact‐sized interfaces, represented a confounding factor. For those, a much poorer prediction performance was achieved, while nonetheless often providing helpful clues on the correct oligomeric state of the protein. The prediction performance was very poor for genuine tetrameric targets, where the inaccuracy of the homology‐built subunit models and the smaller pair‐wise interfaces severely limited the ability to derive the correct assembly mode. Our analysis also shows that docking procedures tend to perform better than standard homology modeling techniques and that highly accurate models of the protein components are not always required to identify their association modes with acceptable accuracy. Proteins 2016; 84(Suppl 1):323–348. © 2016 The Authors Proteins: Structure, Function, and Bioinformatics Published by Wiley Periodicals, Inc.
- 28 April 2016
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 84 (S1) , 323-348
Open AccessPrediction of homoprotein and heteroprotein complexes by protein docking and template‐based modeling: A CASP‐CAPRI experiment
We present the results for CAPRI Round 30, the first joint CASP‐CAPRI experiment, which brought together experts from the protein structure prediction and protein–protein docking communities. The Round comprised 25 targets from amongst those submitted for the CASP11 prediction experiment of 2014. The targets included mostly homodimers, a few homotetramers, and two heterodimers, and comprised protein chains that could readily be modeled using templates from the Protein Data Bank. On average 24 CAPRI groups and 7 CASP groups submitted docking predictions for each target, and 12 CAPRI groups per target participated in the CAPRI scoring experiment. In total more than 9500 models were assessed against the 3D structures of the corresponding target complexes. Results show that the prediction of homodimer assemblies by homology modeling techniques and docking calculations is quite successful for targets featuring large enough subunit interfaces to represent stable associations. Targets with ambiguous or inaccurate oligomeric state assignments, often featuring crystal contact‐sized interfaces, represented a confounding factor. For those, a much poorer prediction performance was achieved, while nonetheless often providing helpful clues on the correct oligomeric state of the protein. The prediction performance was very poor for genuine tetrameric targets, where the inaccuracy of the homology‐built subunit models and the smaller pair‐wise interfaces severely limited the ability to derive the correct assembly mode. Our analysis also shows that docking procedures tend to perform better than standard homology modeling techniques and that highly accurate models of the protein components are not always required to identify their association modes with acceptable accuracy. Proteins 2016; 84(Suppl 1):323–348. © 2016 The Authors Proteins: Structure, Function, and Bioinformatics Published by Wiley Periodicals, Inc.
- 1 February 2016
- Published by Elsevier in Biophysical Journal
- Vol. 110 (3) , 346a
Residue Environment Score for Selecting Protein Structure Models and Protein-Protein Docking Models
- 1 February 2016
- Published by Elsevier in Biophysical Journal
- Vol. 110 (3) , 346a
Residue Environment Score for Selecting Protein Structure Models and Protein-Protein Docking Models
- 21 December 2015
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 56 (6) , 1088-1099
Combined Approach of Patch-Surfer and PL-PatchSurfer for Protein–Ligand Binding Prediction in CSAR 2013 and 2014
The Community Structure–Activity Resource (CSAR) benchmark exercise provides a unique opportunity for researchers to objectively evaluate the performance of protein–ligand docking methods. Patch-Surfer and PL-PatchSurfer, molecular surface-based methods for predicting binding ligands of proteins developed in our group, were tested on both CSAR 2013 and 2014 benchmark exercises in combination with an empirical scoring function-based method, AutoDock, while we only participated in CSAR 2013 using Patch-Surfer. The prediction results for Phase 1 task in CSAR 2013 showed that Patch-Surfer was able to rank all the four designed binding proteins within top ranks, outperforming AutoDock Vina. In Phase 2 of 2013, PL-PatchSurfer correctly selected the correct ligand pose for two target proteins. PL-PatchSurfer performed reasonably well in ranking ligands according to their binding affinity and in selecting near-native ligand poses in 2013 Phase 3 and 2014 Phase 1, respectively, although AutoDock Vina showed better performance. Lastly, in the 2014 Phase 2 exercise, the PL-PatchSurfer scores computed for ligands to target protein pairs correlated well with their pIC50 values, which was better or comparable to results by other participants. Overall, our methods showed fairly good performance in CSAR 2013 and 2014. Unique characteristics of the methods are discussed in comparison with AutoDock.
- 21 December 2015
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 56 (6) , 1088-1099
Combined Approach of Patch-Surfer and PL-PatchSurfer for Protein–Ligand Binding Prediction in CSAR 2013 and 2014
The Community Structure–Activity Resource (CSAR) benchmark exercise provides a unique opportunity for researchers to objectively evaluate the performance of protein–ligand docking methods. Patch-Surfer and PL-PatchSurfer, molecular surface-based methods for predicting binding ligands of proteins developed in our group, were tested on both CSAR 2013 and 2014 benchmark exercises in combination with an empirical scoring function-based method, AutoDock, while we only participated in CSAR 2013 using Patch-Surfer. The prediction results for Phase 1 task in CSAR 2013 showed that Patch-Surfer was able to rank all the four designed binding proteins within top ranks, outperforming AutoDock Vina. In Phase 2 of 2013, PL-PatchSurfer correctly selected the correct ligand pose for two target proteins. PL-PatchSurfer performed reasonably well in ranking ligands according to their binding affinity and in selecting near-native ligand poses in 2013 Phase 3 and 2014 Phase 1, respectively, although AutoDock Vina showed better performance. Lastly, in the 2014 Phase 2 exercise, the PL-PatchSurfer scores computed for ligands to target protein pairs correlated well with their pIC50 values, which was better or comparable to results by other participants. Overall, our methods showed fairly good performance in CSAR 2013 and 2014. Unique characteristics of the methods are discussed in comparison with AutoDock.
- Open Access
- 7 September 2015
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 84 (S1) , 105-117
Protein structure prediction using residue‐ and fragment‐environment potentials in CASP11
An accurate scoring function that can select near‐native structure models from a pool of alternative models is key for successful protein structure prediction. For the critical assessment of techniques for protein structure prediction (CASP) 11, we have built a protocol of protein structure prediction that has novel coarse‐grained scoring functions for selecting decoys as the heart of its pipeline. The score named PRESCO (Protein Residue Environment SCOre) developed recently by our group evaluates the native‐likeness of local structural environment of residues in a structure decoy considering positions and the depth of side‐chains of spatially neighboring residues. We also introduced a helix interaction potential as an additional scoring function for selecting decoys. The best models selected by PRESCO and the helix interaction potential underwent structure refinement, which includes side‐chain modeling and relaxation with a short molecular dynamics simulation. Our protocol was successful, achieving the top rank in the free modeling category with a significant margin of the accumulated Z‐score to the subsequent groups when the top 1 models were considered. Proteins 2016; 84(Suppl 1):105–117.
- 7 September 2015
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 84 (S1) , 105-117
Open AccessProtein structure prediction using residue‐ and fragment‐environment potentials in CASP11
An accurate scoring function that can select near‐native structure models from a pool of alternative models is key for successful protein structure prediction. For the critical assessment of techniques for protein structure prediction (CASP) 11, we have built a protocol of protein structure prediction that has novel coarse‐grained scoring functions for selecting decoys as the heart of its pipeline. The score named PRESCO (Protein Residue Environment SCOre) developed recently by our group evaluates the native‐likeness of local structural environment of residues in a structure decoy considering positions and the depth of side‐chains of spatially neighboring residues. We also introduced a helix interaction potential as an additional scoring function for selecting decoys. The best models selected by PRESCO and the helix interaction potential underwent structure refinement, which includes side‐chain modeling and relaxation with a short molecular dynamics simulation. Our protocol was successful, achieving the top rank in the free modeling category with a significant margin of the accumulated Z‐score to the subsequent groups when the top 1 models were considered. Proteins 2016; 84(Suppl 1):105–117.
- 31 July 2014
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 82 (12) , 3255-3272
Detecting local residue environment similarity for recognizing near‐native structure models
We developed a new representation of local amino acid environments in protein structures called the Side‐chain Depth Environment (SDE). An SDE defines a local structural environment of a residue considering the coordinates and the depth of amino acids that locate in the vicinity of the side‐chain centroid of the residue. SDEs are general enough that similar SDEs are found in protein structures with globally different folds. Using SDEs, we developed a procedure called PRESCO (Protein Residue Environment SCOre) for selecting native or near‐native models from a pool of computational models. The procedure searches similar residue environments observed in a query model against a set of representative native protein structures to quantify how native‐like SDEs in the model are. When benchmarked on commonly used computational model datasets, our PRESCO compared favorably with the other existing scoring functions in selecting native and near‐native models. Proteins 2014; 82:3255–3272.
- 31 July 2014
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 82 (12) , 3255-3272
Detecting local residue environment similarity for recognizing near‐native structure models
We developed a new representation of local amino acid environments in protein structures called the Side‐chain Depth Environment (SDE). An SDE defines a local structural environment of a residue considering the coordinates and the depth of amino acids that locate in the vicinity of the side‐chain centroid of the residue. SDEs are general enough that similar SDEs are found in protein structures with globally different folds. Using SDEs, we developed a procedure called PRESCO (Protein Residue Environment SCOre) for selecting native or near‐native models from a pool of computational models. The procedure searches similar residue environments observed in a query model against a set of representative native protein structures to quantify how native‐like SDEs in the model are. When benchmarked on commonly used computational model datasets, our PRESCO compared favorably with the other existing scoring functions in selecting native and near‐native models. Proteins 2014; 82:3255–3272.