- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
Existing protein generation models primarily focus on residue-level local geometric features, with limited attention to protein domains, which represent an intermediate structural scale between local geometry and global topology. The lack of explicit domain-level constraints may lead to the accumulation of local prediction errors during inference, potentially degrading backbone generation quality and causing substantial structural errors in multidomain protein reconstruction and design. To address these limitations, the authors propose DPAR (Domain-aware Protein Tokenization), a discrete protein backbone generation framework that explicitly incorporates domain information and domain boundaries to improve backbone generation quality.
Critical strengths
- Novelty: As stated by the authors, DPAR is “the first tokenization model to explicitly incorporate domain information into discrete token-based generation.” This represents a meaningful innovation in discrete protein structure representation and generation.
- Significance: Existing protein structure generation models, particularly discrete token-based protein language models (PLMs), primarily focus on residue-level local geometric features and lack explicit modeling of domains as intermediate-scale structural units. This may limit their ability to capture multiscale structural information. DPAR provides a promising approach to addressing this limitation and offers a new perspective on improving protein structure representation and backbone generation quality.
Critical weaknesses
- Insufficient ablation studies on domain-aware modeling. The reviewer suggests directly comparing the full DPAR model with variants that (i) remove the domain-aware encoder, (ii) remove domain boundary prediction, and (iii) replace actual domain boundaries with random boundaries. Such experiments would help determine whether the observed performance improvements primarily arise from explicit domain modeling rather than other components of the framework.
- Insufficient evaluation on multidomain proteins. Most of the reconstruction and generation experiments presented in the paper focus on single-domain proteins. The reviewer suggests conducting additional experiments specifically on multidomain proteins and reporting within-domain errors, inter-domain placement errors, and designability. These evaluations would provide stronger evidence for the effectiveness of DPAR in reconstructing and generating complex multidomain protein structures.
Questions for authors
Please clarify the potential advantages of DPAR over continuous protein backbone generation methods, such as RFdiffusion? In particular, what unique benefits does the domain-aware discrete-token framework offer compared to continuous generative approaches? Clarifying these differences would help me better assess the broader significance of this work.
3 comments
Response to Reviewer YMJo
Comment 2: … conducting additional experiments specifically on multidomain proteins and reporting within-domain errors, inter-domain placement errors, and designability.
Response: Thank you for suggesting a dedicated evaluation of multidomain proteins. We evaluated how well DPAR preserves domain geometry and arrangement in reconstruction, and how often its generated backbones with multiple domains are designable. In reconstruction, DPAR’s main advantage was preserving the relative arrangement of domains. In generation, 279 of the 316 multidomain candidates identified in the length-only experiment met the designability threshold.
(1) Multidomain reconstruction. To evaluate reconstruction on complete multidomain chains, we selected 150 chains with TED annotations [1] from the AFDB [2] validation set. We used the DPAR weights from the submitted paper and ran Kanzi [3], APT [4], and ESM3 [5] on the same chains. DPAR achieved the lowest whole-chain RMSD of the four methods, at 0.7800 Å.
To understand the difference in whole-chain reconstruction, we measured errors in individual domain geometries and in the relative arrangement of domains. W is the RMSD over all domain residues after aligning each domain independently. J is the RMSD after jointly aligning the same domain residues. We use P = √[max(0, J² − W²)] to measure the additional error from joint alignment.
| Model | Whole-chain RMSD ↓ (Å) | Intradomain W ↓ (Å) | Additional joint-alignment error P ↓ (Å) |
|---|---|---|---|
| DPAR | 0.7800 | 0.5835 | 0.3449 |
| Kanzi | 1.0331 | 0.8241 | 0.4905 |
| APT | 2.3734 | 2.0122 | 0.8726 |
| ESM3 | 0.8937 | 0.3181 | 0.6473 |
ESM3 achieved the lowest intradomain error W. DPAR achieved the lowest additional joint-alignment error P, 46.7% below ESM3, and a 12.7% lower whole-chain RMSD. This suggests that DPAR’s advantage on these multidomain chains primarily lies in preserving the relative arrangement of domains.
(2) Multidomain generation. We made 100 generation requests at each of five lengths: 128, 160, 192, 224, and 256 residues. Each request specified only the chain length. We applied Merizo [6] to the ESMFold [7] prediction for the first designed sequence and required at least two domains, at least 20 residues per domain, and at least 0.8 total coverage.
| Model | Designability ↑ | scRMSD ↓ (Å) |
|---|---|---|
| DPAR | 88.29% | 1.516 |
Short-chain comparison after refolding. To assess designability under the short-chain free-generation setting of the submitted paper, we analyzed the generated results of DPAR and two baselines from the paper, APT and ESM3. We used Merizo to segment the refolded structure of the first designed sequence. We applied the same criteria to every model, requiring at least 20 residues per domain and at least 0.8 total coverage. Each model’s designability rate uses its own number of multidomain candidates as the denominator. DPAR achieved the highest designability and the lowest mean whole-chain scRMSD. It also had the lowest mean intradomain and interdomain errors, indicating that refolding better preserved its domain geometry and relative domain arrangement.
| Model | Designability among multidomain candidates ↑ | Mean whole-chain scRMSD ↓ (Å) | Mean intradomain error ↓ (Å) | Mean interdomain error ↓ (Å) |
|---|---|---|---|---|
| DPAR | 97.74% | 1.021 | 0.781 | 0.625 |
| APT | 60.53% | 2.162 | 1.303 | 1.585 |
| ESM3 | 46.58% | 3.381 | 1.940 | 2.558 |
References
[1] Lau, Andy M., et al. “Exploring structural diversity across the protein universe with The Encyclopedia of Domains.” Science 386(6721) (2024): eadq4946.
[2] Varadi, Mihaly, et al. “AlphaFold Protein Structure Database: massively expanding the structural coverage of protein-sequence space with high-accuracy models.” Nucleic Acids Research 50(D1) (2022): D439–D444.
[3] Dilip, Rohit, Evan Zhang, Ayush Varshney, and David Van Valen. “Flow Autoencoders are Effective Protein Tokenizers.” arXiv:2510.00351 (2025).
[4] Dilip, Rohit, Ayush Varshney, and David Van Valen. “Adaptive Protein Tokenization.” arXiv:2602.06418 (2026).
[5] Hayes, Thomas, et al. “Simulating 500 million years of evolution with a language model.” Science 387(6736) (2025): 850–858.
[6] Lau, Andy M., Shaun M. Kandathil, and David T. Jones. “Merizo: a rapid and accurate protein domain segmentation method using invariant point attention.” Nature Communications 14 (2023): 8445.
[7] Lin, Zeming, et al. “Evolutionary-scale prediction of atomic-level protein structure with a language model.” Science 379(6637) (2023): 1123–1130.
Response to Reviewer YMJo
Comment 3: Please clarify the potential advantages of DPAR over continuous protein backbone generation methods, such as RFdiffusion....
Response: Thank you for this question. RFdiffusion [1] generates backbones by denoising continuous 3D residue frames and is designed to use geometric constraints during generation. DPAR provides a discrete representation of backbone geometry and domain boundaries for autoregressive modeling. A flow-matching decoder then maps the generated tokens back to backbone coordinates.
The domain layout is itself a generated output in DPAR. The autoregressive model predicts where domains start and end alongside the structure tokens, so the decoder can use that layout to condition on each domain separately. The token representation also supports different levels of control. A CATH class token specifies a broad structural category without requiring a template, while the structure tokens of a natural domain provide a concrete structural context for extending the chain. Both types of input can be handled by the same autoregressive model.
As discussed in our Introduction, this representation also makes structure easier to incorporate into multimodal protein language models. Backbone geometry, amino acid sequence, and functional information can all enter a model through tokens. Explicit domain boundaries additionally give the model a way to associate information with a particular domain while retaining its place in the larger chain. This makes DPAR a structural component for future joint modeling across protein sequence, structure, and function. [2]
References
[1] Watson, Joseph L., et al. “De novo design of protein structure and function with RFdiffusion.” Nature 620(7976) (2023): 1089–1100.
[2] Hayes, Thomas, et al. “Simulating 500 million years of evolution with a language model.” Science 387(6736) (2025): 850–858.
Response to Reviewer YMJo
Thank you for recognizing the novelty and potential of explicitly modeling domains in discrete protein generation. We appreciate your suggestions for strengthening the ablations and multidomain evaluation.
Response: Thank you for suggesting these comparisons. We evaluated two supplementary models on CAMEO alongside the DPAR result reported in the paper. All three use a flow-matching decoder.
The control model without domain information encodes the whole chain and removes domain annotations, domain conditioning, and auxiliary domain supervision. The model trained with fixed pseudo-boundaries retains domain-aware conditioning and supervision but replaces the original domain intervals during training, while preserving each chain’s domain count, set of domain lengths, and number of covered residues.
Using raw outputs for both supplementary models, the fixed pseudo-boundary model reduced mean RMSD by 0.6190 Å (27.9%) relative to the control without domain information. This suggests that domain partitioning and its associated conditioning and supervision can improve reconstruction even when training uses artificial boundaries. The DPAR result reported in the paper is a further 0.6811 Å lower than the fixed pseudo-boundary result. One possible benefit of the original boundaries is that they group residues from the same folding unit, giving the decoder more coherent information about the geometry within each domain.