Three properties of a decoy pool decide a protein–protein rescoring comparison: the candidate-set size, its composition, and the relaxation of its near-native poses

Abstract A rescoring benchmark compares scoring functions on a fixed decoy set; neither how many poses are kept nor their character is usually reported. We ask which pool properties decide whether such a comparison is well posed. Three pools were compared under one protocol: a perturbation pool built from the bound pose (all 22 rigid untrained complexes of Benchmark 5), the same perturbation on unbound structures (15 complexes), and the published ZDOCK 3.0.2 decoy set, a real Fourier output (14 complexes). The first two differ only in the structures, the second and third only in the pose generator. Only the bound pool supports the claim that a knowledge-based potential beats a shape-complementarity proxy: there it wins 21 of 22 complexes at K = 20 (p < 0.0001). The same perturbation on unbound structures removes most of it (8 of 15, p = 0.79), and on the search output no advantage remains (all p ≥ 0.09). The cause is measurable: the potential’s score is nearly monotonic in the clash count, and only the bound pool supplies clash-free near-native poses, so elsewhere it penalizes the poses it is asked to find. On the search output, the program’s own rescoring algorithm is at chance at K = 20 and helps only from K = 400; densifying the search fifteenfold leaves the pool unchanged. The comparison is well posed only when the size of the candidate set, its origin and composition, the relaxation of its near-native poses, the measure and the null are stated.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-13
DOI
https://doi.org/10.21203/rs.3.rs-11412449/v1
Primary Topic
Protein Structure and Dynamics
Type
preprint

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Three properties of a decoy pool decide a protein–protein rescoring comparison: the candidate-set size, its composition, and the relaxation of its near-native poses

Qianwei Cheng, 孙庭广, Lan Liao
Research Square
Protein Structure and Dynamics
preprint

Three properties of a decoy pool decide a protein–protein rescoring comparison: the candidate-set size, its composition, and the relaxation of its near-native poses

Qianwei Cheng, 孙庭广, Lan Liao
preprint en

Abstract

Abstract A rescoring benchmark compares scoring functions on a fixed decoy set; neither how many poses are kept nor their character is usually reported. We ask which pool properties decide whether such a comparison is well posed. Three pools were compared under one protocol: a perturbation pool built from the bound pose (all 22 rigid untrained complexes of Benchmark 5), the same perturbation on unbound structures (15 complexes), and the published ZDOCK 3.0.2 decoy set, a real Fourier output (14 complexes). The first two differ only in the structures, the second and third only in the pose generator. Only the bound pool supports the claim that a knowledge-based potential beats a shape-complementarity proxy: there it wins 21 of 22 complexes at K = 20 (p < 0.0001). The same perturbation on unbound structures removes most of it (8 of 15, p = 0.79), and on the search output no advantage remains (all p ≥ 0.09). The cause is measurable: the potential’s score is nearly monotonic in the clash count, and only the bound pool supplies clash-free near-native poses, so elsewhere it penalizes the poses it is asked to find. On the search output, the program’s own rescoring algorithm is at chance at K = 20 and helps only from K = 400; densifying the search fifteenfold leaves the pool unchanged. The comparison is well posed only when the size of the candidate set, its origin and composition, the relaxation of its near-native poses, the measure and the null are stated.

Research Square
Guangxi University of Science and Technology (CN)
National Natural Science Foundation of China, Natural Science Foundation of Guangxi Province, Guangxi University of Science and Technology
Protein Structure and Dynamics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon