Overcoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone Flexibility
DOI10.1007/978-3-540-76784-8_4zbMath1382.92209OpenAlexW2099575689MaRDI QIDQ4607140
Ho Ki Fung, Li Zhang, Dimitrios Morikis, Martin S. Taylor, Christodoulos A. Floudas
Publication date: 12 March 2018
Published in: Applied Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76784-8_4
de novo protein designbin variablesfold specificity stagetrue protein backbone flexibilityweighted average forcefield
Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)
Uses Software
Cites Work
- Unnamed Item
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Ab initio tertiary structure prediction of proteins
- Deterministic global optimization. Theory, methods and applications
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Novel formulations for the sequence selection problem in de novo protein design with flexible templates
This page was built for publication: Overcoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone Flexibility
