EDBT 2026 Demo / reviewers in the wild / expert
Dmitry A. Kondrashov
dblp:29/2982
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2007
0000-0003-0248-3539ORCID · reported
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% | |
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › structural bioinformatics
electron density map interpretation |
0.1 | 1 | 2007 | Creating protein models from electron-density maps using particle-filtering methods · Bioinform. 2007 |
Bioinformatics and computational biology › structural biology
protein crystallography |
0.1 | 1 | 2007 | Creating protein models from electron-density maps using particle-filtering methods · Bioinform. 2007 |
Bioinformatics and computational biology › structural bioinformatics
protein modeling |
0.1 | 1 | 2007 | Creating protein models from electron-density maps using particle-filtering methods · Bioinform. 2007 |
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › sequential monte carlo
particle filtering |
0.0 | 1 | 2007 | Creating protein models from electron-density maps using particle-filtering methods · Bioinform. 2007 |
Methods — techniques the papers use, named apart from their topics
probabilistic modeling · 0.1particle filtering · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Creating protein models from electron-density maps using particle-filtering methodsabstractMOTIVATION: One bottleneck in high-throughput protein crystallography is interpreting an electron-density map, that is, fitting a molecular model to the 3D picture crystallography produces. Previously, we developed ACMI (Automatic Crystallographic Map Interpreter), an algorithm that uses a probabilistic model to infer an accurate protein backbone layout. Here, we use a sampling method known as particle filtering to produce a set of all-atom protein models. We use the output of ACMI to guide the particle filter's sampling, producing an accurate, physically feasible set of structures. RESULTS: We test our algorithm on 10 poor-quality experimental density maps. We show that particle filtering produces accurate all-atom models, resulting in fewer chains, lower sidechain RMS error and reduced R factor, compared to simply placing the best-matching sidechains on ACMI's trace. We show that our approach produces a more accurate model than three leading methods--Textal, Resolve and ARP/WARP--in terms of main chain completeness, sidechain identification and crystallographic R factor. AVAILABILITY: Source code and experimental density maps available at http://ftp.cs.wisc.edu/machine-learning/shavlik-group/programs/acmi/ Frank DiMaio, Dmitry A. Kondrashov, Eduard Bitto, Ameet Soni, Craig A. Bingman, George N. Phillips Jr., Jude W. Shavlik |
Bioinform. | 2 |