Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design
DOI10.1007/s10878-005-1859-8zbMath1077.92019OpenAlexW1983562846MaRDI QIDQ2576440
Publication date: 13 December 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-005-1859-8
optimizationstructure predictiondrug designde novo protein designin silico sequence selectionpeptide and protein design and discovery
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Discrete location and assignment (90B80)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- Complexity of uniqueness and local search in quadratic 0-1 programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
This page was built for publication: Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design