Boosting AND/OR-Based Computational Protein Design: Dynamic Heuristics and Generalizable UFO
Not on the map. Why?
Abstract (arXiv)
Scientific computing has experienced a surge empowered by advancements in technologies such as neural networks. However, certain important tasks are less amenable to these technologies, benefiting from innovations to traditional inference schemes. One such task is protein re-design. Recently a new re-design algorithm, AOBB-K*, was introduced and was competitive with state-of-the-art BBK* on small protein re-design problems. However, AOBB-K* did not scale well. In this work we focus on scaling up AOBB-K* and introduce three new versions: AOBB-K*-b (boosted), AOBB-K*-DH (with dynamic heuristics), and AOBB-K*-UFO (with underflow optimization) that significantly enhance scalability.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 46 references that are in the map. First posted on arXiv 31 Aug 2023.
Builds on
2 of 46 references.
References · 2
- 2014Computational Protein Design Using AND/OR Branch-and-Bound Searchcited by 1
- 2018Protein Design by Algorithmcited by 1
Built on by
Not cited yet.