Demo Data from EDBT 2026 / reviewers in the wild / expert
Hao Fan 0002
dblp:23/2535-2
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › protein structure prediction
loop modeling |
0.2 | 1 | 2013 | Optimized atomic statistical potentials: assessment of protein interfaces and loops · Bioinform. 2013 |
Bioinformatics and computational biology › protein structure prediction
protein-protein docking |
0.2 | 1 | 2013 | Optimized atomic statistical potentials: assessment of protein interfaces and loops · Bioinform. 2013 |
Bioinformatics and computational biology
protein structure prediction |
0.2 | 1 | 2013 | Optimized atomic statistical potentials: assessment of protein interfaces and loops · Bioinform. 2013 |
Bioinformatics and computational biology › molecular informatics › molecular modeling
scoring function |
0.2 | 1 | 2013 | Optimized atomic statistical potentials: assessment of protein interfaces and loops · Bioinform. 2013 |
Bioinformatics and computational biology › protein structure analysis
statistical potential |
0.2 | 1 | 2013 | Optimized atomic statistical potentials: assessment of protein interfaces and loops · Bioinform. 2013 |
Methods — techniques the papers use, named apart from their topics
bayesian inference · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Optimized atomic statistical potentials: assessment of protein interfaces and loopsabstractMOTIVATION: Statistical potentials have been widely used for modeling whole proteins and their parts (e.g. sidechains and loops) as well as interactions between proteins, nucleic acids and small molecules. Here, we formulate the statistical potentials entirely within a statistical framework, avoiding questionable statistical mechanical assumptions and approximations, including a definition of the reference state. RESULTS: We derive a general Bayesian framework for inferring statistically optimized atomic potentials (SOAP) in which the reference state is replaced with data-driven 'recovery' functions. Moreover, we restrain the relative orientation between two covalent bonds instead of a simple distance between two atoms, in an effort to capture orientation-dependent interactions such as hydrogen bonds. To demonstrate this general approach, we computed statistical potentials for protein-protein docking (SOAP-PP) and loop modeling (SOAP-Loop). For docking, a near-native model is within the top 10 scoring models in 40% of the PatchDock benchmark cases, compared with 23 and 27% for the state-of-the-art ZDOCK and FireDock scoring functions, respectively. Similarly, for modeling 12-residue loops in the PLOP benchmark, the average main-chain root mean square deviation of the best scored conformations by SOAP-Loop is 1.5 Å, close to the average root mean square deviation of the best sampled conformations (1.2 Å) and significantly better than that selected by Rosetta (2.1 Å), DFIRE (2.3 Å), DOPE (2.5 Å) and PLOP scoring functions (3.0 Å). Our Bayesian framework may also result in more accurate statistical potentials for additional modeling applications, thus affording better leverage of the experimentally determined protein structures. AVAILABILITY AND IMPLEMENTATION: SOAP-PP and SOAP-Loop are available as part of MODELLER (http://salilab.org/modeller). Guang Qiang Dong, Hao Fan 0002, Dina Schneidman, Ben M. Webb, Andrej Sali |
Bioinform. | 2 |