Demo Data from VLDB 2026 / reviewers in the wild / expert
Robin Pearce
dblp:261/4072
· DBLP profile ↗
6ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0001-6402-734XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 6 · 1 first-author · 1 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
4 papers |
Bioinformatics and computational biology · 100% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
protein structure prediction |
1.0 | 3 | 2020 | FUpred: detecting protein domains through deep-learning-based contact map prediction · Bioinform. 2020 FASPR: an open-source tool for fast and accurate protein side-chain packing · Bioinform. 2020 EvoEF2: accurate and fast energy function for computational protein design · Bioinform. 2020 |
Bioinformatics and computational biology
protein design |
0.6 | 2 | 2020 | EvoEF2: accurate and fast energy function for computational protein design · Bioinform. 2020 FASPR: an open-source tool for fast and accurate protein side-chain packing · Bioinform. 2020 |
Bioinformatics and computational biology › molecular property prediction
binding affinity change |
0.4 | 1 | 2020 | SSIPe: accurately estimating protein-protein binding affinity change upon mutations using evolutionary profiles in combination with an optimized physical energy function · Bioinform. 2020 |
Bioinformatics and computational biology › protein structure analysis › protein domain identification
protein domain parsing |
0.4 | 1 | 2020 | FUpred: detecting protein domains through deep-learning-based contact map prediction · Bioinform. 2020 |
Bioinformatics and computational biology › protein analysis
protein-protein interaction |
0.4 | 1 | 2020 | SSIPe: accurately estimating protein-protein binding affinity change upon mutations using evolutionary profiles in combination with an optimized physical energy function · Bioinform. 2020 |
Bioinformatics and computational biology › protein design
protein sequence design |
0.4 | 1 | 2020 | EvoEF2: accurate and fast energy function for computational protein design · Bioinform. 2020 |
Bioinformatics and computational biology › protein structure prediction
residue contact prediction |
0.4 | 1 | 2020 | FUpred: detecting protein domains through deep-learning-based contact map prediction · Bioinform. 2020 |
Bioinformatics and computational biology › protein structure prediction
side-chain prediction |
0.4 | 1 | 2020 | FASPR: an open-source tool for fast and accurate protein side-chain packing · Bioinform. 2020 |
Bioinformatics and computational biology › statistical genetics
variant effect prediction |
0.4 | 1 | 2020 | SSIPe: accurately estimating protein-protein binding affinity change upon mutations using evolutionary profiles in combination with an optimized physical energy function · Bioinform. 2020 |
Bioinformatics and computational biology › protein design
computational protein design |
0.1 | 1 | 2020 | FASPR: an open-source tool for fast and accurate protein side-chain packing · Bioinform. 2020 |
Methods — techniques the papers use, named apart from their topics
physical energy function · 0.9tree decomposition · 0.4sequence recapitulation · 0.4pseudo-counts · 0.4parameter optimization · 0.4optimized scoring function · 0.4evolutionary profile · 0.4deep residual neural network · 0.4dead-end elimination · 0.4coevolutionary precision matrix · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Fast and accurate Ab Initio Protein structure prediction using deep learning potentialsabstractDespite the immense progress recently witnessed in protein structure prediction, the modeling accuracy for proteins that lack sequence and/or structure homologs remains to be improved. We developed an open-source program, DeepFold, which integrates spatial restraints predicted by multi-task deep residual neural-networks along with a knowledge-based energy function to guide its gradient-descent folding simulations. The results on large-scale benchmark tests showed that DeepFold creates full-length models with accuracy significantly beyond classical folding approaches and other leading deep learning methods. Of particular interest is the modeling performance on the most difficult targets with very few homologous sequences, where DeepFold achieved an average TM-score that was 40.3% higher than trRosetta and 44.9% higher than DMPfold. Furthermore, the folding simulations for DeepFold were 262 times faster than traditional fragment assembly simulations. These results demonstrate the power of accurately predicted deep learning potentials to improve both the accuracy and speed of ab initio protein structure prediction. Robin Pearce, Yang Li 0107, Gilbert S. Omenn, Yang Zhang 0040 |
PLoS Comput. Biol. | 1 |
| 2020 | FASPR: an open-source tool for fast and accurate protein side-chain packingabstractMOTIVATION: Protein structure and function are essentially determined by how the side-chain atoms interact with each other. Thus, accurate protein side-chain packing (PSCP) is a critical step toward protein structure prediction and protein design. Despite the importance of the problem, however, the accuracy and speed of current PSCP programs are still not satisfactory. RESULTS: We present FASPR for fast and accurate PSCP by using an optimized scoring function in combination with a deterministic searching algorithm. The performance of FASPR was compared with four state-of-the-art PSCP methods (CISRR, RASP, SCATD and SCWRL4) on both native and non-native protein backbones. For the assessment on native backbones, FASPR achieved a good performance by correctly predicting 69.1% of all the side-chain dihedral angles using a stringent tolerance criterion of 20°, compared favorably with SCWRL4, CISRR, RASP and SCATD which successfully predicted 68.8%, 68.6%, 67.8% and 61.7%, respectively. Additionally, FASPR achieved the highest speed for packing the 379 test protein structures in only 34.3 s, which was significantly faster than the control methods. For the assessment on non-native backbones, FASPR showed an equivalent or better performance on I-TASSER predicted backbones and the backbones perturbed from experimental structures. Detailed analyses showed that the major advantage of FASPR lies in the optimal combination of the dead-end elimination and tree decomposition with a well optimized scoring function, which makes FASPR of practical use for both protein structure modeling and protein design studies. AVAILABILITY AND IMPLEMENTATION: The web server, source code and datasets are freely available at https://zhanglab.ccmb.med.umich.edu/FASPR and https://github.com/tommyhuangthu/FASPR. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Xiaoqiang Huang, Robin Pearce, Yang Zhang 0040 |
Bioinform. | 2 |
| 2020 | EvoEF2: accurate and fast energy function for computational protein designabstractMOTIVATION: The accuracy and success rate of de novo protein design remain limited, mainly due to the parameter over-fitting of current energy functions and their inability to discriminate incorrect designs from correct designs. RESULTS: We developed an extended energy function, EvoEF2, for efficient de novo protein sequence design, based on a previously proposed physical energy function, EvoEF. Remarkably, EvoEF2 recovered 32.5%, 47.9% and 22.3% of all, core and surface residues for 148 test monomers, and was generally applicable to protein-protein interaction design, as it recapitulated 30.9%, 42.4%, 31.3% and 21.4% of all, core, interface and surface residues for 88 test dimers, significantly outperforming EvoEF on the native sequence recapitulation. We further used I-TASSER to evaluate the foldability of the 148 designed monomer sequences, where all of them were predicted to fold into structures with high fold- and atomic-level similarity to their corresponding native structures, as demonstrated by the fact that 87.8% of the predicted structures shared a root-mean-square-deviation less than 2 Å to their native counterparts. The study also demonstrated that the usefulness of physical energy functions is highly correlated with the parameter optimization processes, and EvoEF2, with parameters optimized using sequence recapitulation, is more suitable for computational protein sequence design than EvoEF, which was optimized on thermodynamic mutation data. AVAILABILITY AND IMPLEMENTATION: The source code of EvoEF2 and the benchmark datasets are freely available at https://zhanglab.ccmb.med.umich.edu/EvoEF. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Xiaoqiang Huang, Robin Pearce, Yang Zhang 0040 |
Bioinform. | 2 |
| 2020 | SSIPe: accurately estimating protein-protein binding affinity change upon mutations using evolutionary profiles in combination with an optimized physical energy functionabstractMOTIVATION: Most proteins perform their biological functions through interactions with other proteins in cells. Amino acid mutations, especially those occurring at protein interfaces, can change the stability of protein-protein interactions (PPIs) and impact their functions, which may cause various human diseases. Quantitative estimation of the binding affinity changes (ΔΔGbind) caused by mutations can provide critical information for protein function annotation and genetic disease diagnoses. RESULTS: We present SSIPe, which combines protein interface profiles, collected from structural and sequence homology searches, with a physics-based energy function for accurate ΔΔGbind estimation. To offset the statistical limits of the PPI structure and sequence databases, amino acid-specific pseudocounts were introduced to enhance the profile accuracy. SSIPe was evaluated on large-scale experimental data containing 2204 mutations from 177 proteins, where training and test datasets were stringently separated with the sequence identity between proteins from the two datasets below 30%. The Pearson correlation coefficient between estimated and experimental ΔΔGbind was 0.61 with a root-mean-square-error of 1.93 kcal/mol, which was significantly better than the other methods. Detailed data analyses revealed that the major advantage of SSIPe over other traditional approaches lies in the novel combination of the physical energy function with the new knowledge-based interface profile. SSIPe also considerably outperformed a former profile-based method (BindProfX) due to the newly introduced sequence profiles and optimized pseudocount technique that allows for consideration of amino acid-specific prior mutation probabilities. AVAILABILITY AND IMPLEMENTATION: Web-server/standalone program, source code and datasets are freely available at https://zhanglab.ccmb.med.umich.edu/SSIPe and https://github.com/tommyhuangthu/SSIPe. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Xiaoqiang Huang, Wei Zheng 0013, Robin Pearce, Yang Zhang 0040 |
Bioinform. | 3 |
| 2020 | FUpred: detecting protein domains through deep-learning-based contact map predictionabstractMOTIVATION: Protein domains are subunits that can fold and function independently. Correct domain boundary assignment is thus a critical step toward accurate protein structure and function analyses. There is, however, no efficient algorithm available for accurate domain prediction from sequence. The problem is particularly challenging for proteins with discontinuous domains, which consist of domain segments that are separated along the sequence. RESULTS: We developed a new algorithm, FUpred, which predicts protein domain boundaries utilizing contact maps created by deep residual neural networks coupled with coevolutionary precision matrices. The core idea of the algorithm is to retrieve domain boundary locations by maximizing the number of intra-domain contacts, while minimizing the number of inter-domain contacts from the contact maps. FUpred was tested on a large-scale dataset consisting of 2549 proteins and generated correct single- and multi-domain classifications with a Matthew's correlation coefficient of 0.799, which was 19.1% (or 5.3%) higher than the best machine learning (or threading)-based method. For proteins with discontinuous domains, the domain boundary detection and normalized domain overlapping scores of FUpred were 0.788 and 0.521, respectively, which were 17.3% and 23.8% higher than the best control method. The results demonstrate a new avenue to accurately detect domain composition from sequence alone, especially for discontinuous, multi-domain proteins. AVAILABILITY AND IMPLEMENTATION: https://zhanglab.ccmb.med.umich.edu/FUpred. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Wei Zheng 0013, Qiqige Wuyun, Robin Pearce, Yang Li 0107, Yang Zhang 0040 |
Bioinform. | 4 |
| 2019 | Detecting distant-homology protein structures by aligning deep neural-network based contact mapsabstractAccurate prediction of atomic-level protein structure is important for annotating the biological functions of protein molecules and for designing new compounds to regulate the functions. Template-based modeling (TBM), which aims to construct structural models by copying and refining the structural frameworks of other known proteins, remains the most accurate method for protein structure prediction. Due to the difficulty in recognizing distant-homology templates, however, the accuracy of TBM decreases rapidly when the evolutionary relationship between the query and template vanishes. In this study, we propose a new method, CEthreader, which first predicts residue-residue contacts by coupling evolutionary precision matrices with deep residual convolutional neural-networks. The predicted contact maps are then integrated with sequence profile alignments to recognize structural templates from the PDB. The method was tested on two independent benchmark sets consisting collectively of 1,153 non-homologous protein targets, where CEthreader detected 176% or 36% more correct templates with a TM-score >0.5 than the best state-of-the-art profile- or contact-based threading methods, respectively, for the Hard targets that lacked homologous templates. Moreover, CEthreader was able to identify 114% or 20% more correct templates with the same Fold as the query, after excluding structures from the same SCOPe Superfamily, than the best profile- or contact-based threading methods. Detailed analyses show that the major advantage of CEthreader lies in the efficient coupling of contact maps with profile alignments, which helps recognize global fold of protein structures when the homologous relationship between the query and template is weak. These results demonstrate an efficient new strategy to combine ab initio contact map prediction with profile alignments to significantly improve the accuracy of template-based structure prediction, especially for distant-homology proteins. Wei Zheng 0013, Qiqige Wuyun, Yang Li 0107, S. M. Mortuza, Robin Pearce, Jishou Ruan, Yang Zhang 0040 |
PLoS Comput. Biol. | 6 |