Macromolecular recognition in the Protein Data Bank
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Crystal structures deposited in the Protein Data Bank illustrate the diversity of biological macromolecular recognition: transient interactions in protein-protein and protein-DNA complexes and permanent assemblies in homodimeric proteins. The geometric and physical chemical properties of the macromolecular interfaces that may govern the stability and specificity of recognition are explored in complexes and homodimers compared with crystal-packing interactions. It is found that crystal-packing interfaces are usually much smaller; they bury fewer atoms and are less tightly packed than in specific assemblies. Standard-size interfaces burying 1200-2000 A2 of protein surface occur in protease-inhibitor and antigen-antibody complexes that assemble with little or no conformation changes. Short-lived electron-transfer complexes have small interfaces; the larger size of the interfaces observed in complexes involved in signal transduction and homodimers correlates with the presence of conformation changes, often implicated in biological function. Results of the CAPRI (critical assessment of predicted interactions) blind prediction experiment show that docking algorithms efficiently and accurately predict the mode of assembly of proteins that do not change conformation when they associate. They perform less well in the presence of large conformation changes and the experiment stimulates the development of novel procedures that can handle such changes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it