- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2(+1)
- Soundness
- 2
Read review
Paper summary
This paper presents OmniPepBuilder, a training-free framework for designing linear and cyclic peptide binders. The proposed framework consists of two stages: global exploration of peptide–protein binding poses and local sequence refinement within selected pose basins. The main methodological contribution is a Go-Explore-inspired search strategy that combines state replay, dynamic structural cell partitioning, and revisit penalties to improve exploration efficiency and pose diversity. Local refinement subsequently employs ProteinMPNN-based mutation proposals and Rosetta interface energy to optimize predicted interactions while preserving the binding pose.
The paper also includes preliminary benchmarks of cyclic peptide structure representations and binding-affinity scoring metrics. The proposed method is evaluated across eight protein targets and five peptide topologies against several existing binder design approaches. Additional computational applications to multi-target peptide binders and macrocyclic molecular glues are presented.
Overall, the paper covers a broad range of computational experiments, but the connection between these experiments and the central methodological contributions is not always sufficiently established.
Critical strengths
The paper addresses an important problem in peptide binder design and presents a practical framework for improving the exploration of diverse binding poses. The experiments cover multiple protein targets, peptide topologies, and existing design methods. The structural representation and binding-scoring benchmarks provide useful empirical insights, and the implementation details are generally well documented.
Critical weaknesses
Despite the extensive experiments, the validation is not sufficiently focused on the central methodological contributions. The proposed exploration strategy mainly combines existing techniques, while its advantages over simpler search alternatives remain unclear. The main performance comparisons rely on linearly extrapolated pose-cluster counts, and he global-exploration benchmark and its policy ablations rely on single-seed trajectories, without repeated runs or statistical analysis. Furthermore, the reported improvements largely depend on computational confidence metrics, with limited independent validation of binding plausibility. The local refinement and multi-target applications are also not systematically evaluated as a complete framework. Consequently, the title's emphasis on Unified Peptide Binder Design may overstate the demonstrated scope.
Questions for authors
- While the no-replay ablation demonstrates the value of reusing intermediate states, the benefit of the specific allocation strategy remains unclear. Could the authors compare against simpler alternatives, such as uniform or confidence-based replay, under the same computational budget?
- Figure 4 relies on linearly extrapolated pose-cluster throughput, although the number of distinct clusters may not scale linearly with sample size. Could the authors report the observed results without extrapolation and clarify whether the main conclusions remain consistent under matched evaluation budgets?
- Appendix C.4 reports substantial disagreement between AF3 and Protenix-v2, particularly for isopeptide designs. Could the authors clarify how much of this disagreement arises from cyclization geometry versus prediction confidence, and provide further evidence supporting the structural validity of these designs?
- The global-exploration ablations rely on single-seed trajectories, and the single-cell ablation modifies multiple selection criteria. Could the authors provide results across multiple independent seeds and more isolated ablations to establish the robustness of the proposed exploration mechanisms?
4 comments
Response to Reviewer cYmV (2/2)
3. Orthogonal prediction and structural validity
Appendix C.4 reports substantial disagreement between AF3 and Protenix-v2, particularly for isopeptide designs. Could the authors clarify how much of this disagreement arises from cyclization geometry versus prediction confidence, and provide further evidence supporting the structural validity of these designs?
Furthermore, the reported improvements largely depend on computational confidence metrics, with limited independent validation of binding plausibility.
We would like to note that OmniPepBuilder retains its advantage under orthogonal prediction and structural validity checks. Requiring acceptance by both AF3 and Protenix v2 preserves a 3.1–12.7-fold pooled-throughput advantage on matched cases (Fig. 15a). Separately, PoseBusters-style clash screening followed by Rosetta peptide-energy screening preserves a 2.6–9.4-fold advantage (Fig. 15b). To assess binding plausibility beyond predictor confidence, we also evaluated Rosetta separated-interface energies, which are more favorable than those of external baselines in most matched cases (Fig. 17; Appendix C.4.3).
For isopeptides, linkage geometry accounts for most Protenix rejections. Among 1,738 AF3-accepted designs across generators, 1,728 fail Protenix linkage-distance checks and 826 fail confidence thresholds (Appendix C.4.3). The issue extends across generators, including 580/581 BoltzGen isopeptides. Our native-complex benchmark also finds that none of the 30 selected Protenix v2 predictions meets the isopeptide distance-closure criterion (Fig. 12; Appendix A.3). Together, these findings suggest that limited isopeptide-closure accuracy in Protenix v2 contributes to the disagreement, which is not specific to OmniPepBuilder.
We acknowledge that these metrics do not yet provide a well-calibrated estimate of experimental binding success. We are therefore pursuing experimental binding validation.
4. Local refinement and multi-target applications
The local refinement and multi-target applications are also not systematically evaluated as a complete framework.
Both local refinement and multi-target/glue design have been evaluated computationally. Local refinement has a matched benchmark across six targets (Section 3.2; Appendix D.2), and Fig. 6 shows refinement of AF3-generated candidates. Section 4 and Appendix E.1 evaluate the global-proposal extension to multi-target binders and glues across seven campaigns (Table 6), using shared sequences, joint pose neighborhoods and acceptance at every required interface.
We acknowledge that these computational evaluations do not yet establish experimental binding or activity. As discussed in the Introduction, peptide design still lacks broadly validated metrics and filters across therapeutic targets. We therefore call on the community to build large, consistently measured peptide-design datasets, following efforts in minibinder [2] and antibody design [3], to calibrate screening against experimental outcomes. For E3-recruiting glues, predicted ternary compatibility alone does not establish productive ubiquitination or degradation; we are pursuing wet-lab validation of these functional outcomes.
We did not include further baseline comparisons because relevant approaches, including Odin-Multi [4] and EvoBind-multimer [5], emerged concurrently with our work; we plan to benchmark them in follow-up work. We do note that EvoBind-multimer has a substantial per-trajectory computational cost: its reported 1,000-step trajectory takes 8–11 hours on one A100 40GB GPU. Odin-Multi reports a median of 23.3 minutes per trajectory for its two-toxin task on one T4. For context, our MDM2/MDMX and VHL–BRD4 campaigns yield 134 accepted designs in 42 pose groups and 73 in 19 groups, respectively, in 5.34 and 11.31 hours on four L40S GPUs (Table 6). These campaign outcomes demonstrate efficient discovery of diverse predicted poses in the evaluated multi-target and glue applications.
[2] Cao et al., Design of protein-binding proteins from the target structure alone. Nature, 2022.
[3] Bennett et al., Atomically accurate de novo design of antibodies with RFdiffusion. Nature, 2026.
[4] Brasas et al., Specificity-driven protein binder design with Odin-Multi. bioRxiv, 2026.
[5] Brunner et al., De novo Design of Macrocyclic Molecular Glues. bioRxiv, 2026.
Thank you for the detailed rebuttal and substantial additional experiments. I appreciate the full-pool evaluation without linear extrapolation, the new comparisons with simpler replay strategies, and the additional structural validity checks. These results address several of my main concerns and provide stronger evidence for the proposed exploration strategy.
I still have some reservations about the statistical robustness of the single-seed exploration experiments and the limited end-to-end validation of the complete framework. However, I acknowledge that the revised manuscript presents a clearer methodological contribution with more convincing experimental support. I am therefore inclined to raise my score from 2 to 3.
Thank you for your feedback
Thank you for your thoughtful reassessment and for raising your score. We appreciate your constructive feedback, which helped us strengthen the evaluation and clarify our methodological contribution.
Response to Reviewer cYmV (1/2)
We thank the reviewer for the detailed feedback on evaluation and the exploration policy. We address the main concerns in four points below.
1. Full-pool evaluation without linear extrapolation
We thank the reviewer for identifying the extrapolation issue. Previously, resource constraints led us to evaluate subsampled pools for RFpeptides, BoltzGen and AnewOmni. Because additional candidates can belong to existing pose groups, linear extrapolation overestimated the baselines' diversity. We now evaluate their complete output pools and report observed counts. The updated full-pool benchmark preserves a 2.5–9.7-fold pooled-throughput advantage over all five external baselines, on each comparator's supported cases (Fig. 4a). All methods use the common 12-hour, single-GPU generation allowance, with throughput calculated from observed accepted pose groups divided by actual generation GPU-hours (Appendix C.3.3).
2. Controlled ablations and the exploration policy
Confidence-based replay was already included as the original single-cell ablation; we have rewritten its description to clarify this comparison. We have also added Uniform replay, with all control settings summarized in Table 4. Both simpler replay policies yield significantly fewer accepted pose groups than our full policy: under the same 12-hour generation budget, they reduce median yield by 29.9% and 12.0%, respectively, across 14 cases spanning seven targets and two topologies (Fig. 5). The exploratory paired-test p-values are 0.000244 and 0.00537 (Appendix C.4.4). These results show that replay alone is insufficient: how states are retained and replay effort is allocated matters.
We would like to argue that our contribution is a new pose-aware cell-partitioning and replay-allocation scheme, well motivated by the need to discover diverse binding basins. Confidence-only optimization can concentrate sampling in readily accessible regions. We therefore compare candidates within local pose neighborhoods, retaining promising alternatives across basins and dynamically grouping them into cells (Section 3.1; Appendix C.1). Unlike the single representative retained per cell in original Go-Explore [1], every retained local Pareto state remains available for replay. Our allocation then balances proximity to confidence thresholds with cell size and return history: densely populated cells do not gain priority solely through multiplicity, and repeated returns shift relative priority toward less explored regions.
We would like to note that we have added exact paired significance tests across the evaluated target–topology cases, supporting systematic trends across multiple systems (Appendix C.4.4). All global-policy ablations used the fixed seed 2026, with no manual cherry-picking. Due to computational resource limitations, multi-seed runs are still ongoing; we will add their results when completed.
Regarding the request for more isolated ablations, all comparisons use the same prediction models, acceptance criteria and computational budget (Table 4; Appendix C.3.4). In the original single-cell control, Pareto selection becomes global and the common cell-size and history factors cancel, yielding confidence-based replay. This tests the contribution of spatial organization. No revisit penalty separately isolates the history term while preserving local Pareto retention, cell balancing and confidence weighting. Its aggregate effect is small, but retaining the penalty yields 25–35% more pose groups on both KRAS G12D topologies and head-to-tail CXCR4 (Fig. 18).
[1] Ecoffet et al., First return, then explore. Nature, 2021.