Computational protein design as an optimization problem
From MaRDI portal
Publication:2453727
Recommendations
- An exact algorithm for side-chain placement in protein design
- Approximate Counting with Deterministic Guarantees for Affinity Computation
- A Novel Minimized Dead-End Elimination Criterion and Its Application to Protein Redesign in a Hybrid Scoring and Search Algorithm for Computing Partition Functions over Molecular Ensembles
- scientific article; zbMATH DE number 2081008
- The protein structure prediction problem: A constraint optimization approach using a new lower bound
Cites work
- A Computational Study of Search Strategies for Mixed Integer Programming
- AND/OR search spaces for graphical models
- Arc consistency for soft constraints
- Biq Mac
- Branching rules revisited
- Depth-first iterative-deepening: An optimal admissible tree search
- Exploiting the power of MIP solvers in MAXSAT
- GAC Via Unit Propagation
- High-order consistency in valued constraint satisfaction
- scientific article; zbMATH DE number 5485536 (Why is no real title available?)
- scientific article; zbMATH DE number 2080322 (Why is no real title available?)
- scientific article; zbMATH DE number 2084725 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Linear programming relaxations and belief propagation -- an empirical study
- Mini-buckets: a general scheme for bounded inference
- Minimaxsat: an efficient weighted Max-SAT solver
- New Upper Bounds for Maximum Satisfiability
- Probabilistic graphical models.
- Reasoning from last conflict(s) in constraint programming
- Soft arc consistency revisited
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving frequency assignment problems via tree-decomposition
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving weighted CSP by maintaining arc consistency
- Solving wind farm layout optimization with mixed integer programming and constraint programming
- The design of the zinc modelling language
Cited in
(19)- Strategies for protein folding and design
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
- Multiple-choice knapsack constraint in graphical models
- Variable neighborhood search for graphical model energy minimization
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design
- BWM*: A novel, provable, ensemble-based dynamic programming algorithm for sparse approximations of computational protein design
- Tractability-preserving transformations of global cost functions
- A Novel Minimized Dead-End Elimination Criterion and Its Application to Protein Redesign in a Hybrid Scoring and Search Algorithm for Computing Partition Functions over Molecular Ensembles
- Overcoming the key challenges in de novo protein design: enhancing computational efficiency and incorporating true backbone flexibility
- scientific article; zbMATH DE number 1424374 (Why is no real title available?)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- The cavity method to protein design problem
- Approximate Counting with Deterministic Guarantees for Affinity Computation
- Virtual pairwise consistency in cost function networks
- Valued constraint satisfaction problems
- Scaling neuro-symbolic problem solving: solver-free learning of constraints and objectives
- Enhancing MaxSAT local search via a unified soft clause weighting scheme
- An exact algorithm for side-chain placement in protein design
This page was built for publication: Computational protein design as an optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453727)
