Abstract
In this paper an O(n2) mathematical formulation for in silico sequence selection in de novo protein design proposed by Klepeis et al. (2003, 2004), in which the number of additional variables and linear constraints scales with the square of the number of binary variables, is compared to three O(n) formulations. It is found that the O(n2) formulation is superior to the O(n) formulations on most sequence search spaces. The superiority of the O(n2) formulation is due to the reformulation linearization techniques (RLTs), since the O(n2) formulation without RLTs is found to be computationally less efficient than the O(n) formulations. In addition, new algorithmic enhancing components of RLTs with inequality constraints, triangle inequalities, and Dead-End Elimination (DEE) type preprocessing are added to the O(n2) formulation. The current best O(n2) formulation, which is the original formulation from Klepeis et al. (2003, 2004) plus DEE type preprocessing, is proposed for in silico sequence search. For a test problem with a search space of 3.4×1045 sequences, this new improved model is able to reduce the required CPU time by 67%.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Adjiman, I. Androulakis, and C.A. Floudas, “A Global optimization method, αBB, for general twice-differential constrained NPLs–I. theoretical advances,” Computers Chem. Engng., vol. 22, pp. 1137–1158, 1998a.
C. Adjiman, I. Androulakis, and C.A. Floudas, “A global optimization method, αBB, for general twice-differentiable constrained NLPs–II. implementation and computational results,” Computers Chem. Engng., vol. 22, pp. 1159–1179, 1998b.
C. Adjiman, I. Androulakis, and C.A. Floudas, “Global optimization of mixed-integer nonlinear problems,” AiChE Journal, vol. 46, pp. 1769–1797, 2000.
CPLEX: 1997, “Using the CPLEX Callable Library,” ILOG, Inc.
C.A. Floudas, Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, 1995.
C.A. Floudas, Deterministic Global Optimization: Theory, Methods and Applications, Nonconvex Optimization and its Applications. Kluwer Academic Publishers, 2000.
J. García, J. Florian, S. Schulz, A. Krause, F. Rodríguez-Jiménez, U. Forssmann, K. Adermann, E. Klüver, C. Vogelmeier, D. Becker, R. Hedrich, W. Forssmann, and R. Bals, “Identification of a novel, multifunctional β-defensin (human β-Defensin 3) with specific antimicrobial activity,” Cell and Tissue Research, vol. 306, pp. 257–264, 2001.
F. Glover, “Improved linear integer programming formulations of nonlinear integer problems,” Management Science, vol. 22, 455–460, 1975.
R. Goldstein, “Efficient rotamer elimination applied to protein side-chains and related spin glasses,” Biophysics Journal, vol. 66, pp. 1335–1340, 1994.
B. Gordon, G. Hom, S. Mayo, and N. Pierce, “Exact rotamer optimization for protein design,” J. Computational Chemistry, vol. 24, pp. 232–243, 2003.
D. Hoover, O. Chertov, and J. Lubkowski, “The structure of human β-defensin-1,” J. Biol. Chem., vol. 276, pp. 39021–39026, 2001.
D. Hoover, K. Rajashankar, R. Blumenthal, A. Puri, J. Oppenheim, O. Chertov, and J. Lubkowski, “The structure of human β-defensin-2 shows evidence of higher order oligomeration,” J. Biol. Chem., vol. 275, pp. 32911–32918, 2000.
J. Klepeis, C. Floudas, D. Morikis, C. Tsokos, E. Argyropoulos, L. Spruce, and J. Lambris, “Integrated computational and experimental approach for lead optimization and design of compstatin variants with improved activity,” J. Am. Chem. Soc., vol. 125, pp. 8422–8423, 2003.
J. Klepeis, C. Floudas, D. Morikis, C. Tsokos, and J. Lambris, “Design of peptide analogs with improved activity using a novel de novo protein design approach,” Industrial & Engineering Chemistry Research, vol. 43, p. 3817, 2004.
J.L. Klepeis and C.A. Floudas, “Free energy calculations for peptides via deterministic global optimization,” J. Chem. Phys., vol. 110, pp. 7491–7512, 1999.
J.L. Klepeis, C.A. Floudas, D. Morikis, and J. Lambris, “Predicting peptide structures using NMR data and deterministic global optimization,” J. Comput. Chem., vol. 20, pp. 1354–1370, 1999.
J.L. Klepeis, H.D. Schafroth, K.M. Westerberg, and C.A. Floudas, “Deterministic global optimization and Ab Initio approaches for the structure prediction of polypeptides, dynamics of protein folding and protein-protein interaction,” In: R.A. Friesner (ed.): Advances in Chemical Physics, vol. 120. Wiley, pp. 254–457, 2002.
T. Kortemme and D. Baker, “Computational design of protein-protein interactions,” Current Opinion in Chemical Biology, vol. 8, pp. 91–97, 2004.
C. Kraemer-Pecore, A. Wollacott, and J. Desjarlais, “Computational protein design,” Current Opinion in Chemical Biology., vol. 5, pp. 690–695, 2001.
B. Kuhlman and D. Baker, “Exploring folding free energy landscapes using computational protein design,” Current Opinion in Structural Biology., vol. 14, pp. 89–95, 2004.
C. Loose, J. Klepeis, and C. Floudas, “A new pairwise folding potential based on improved decoy generation and side chain packing,” Proteins, vol. 54, pp. 303–314, 2004.
S. Malakauskas and S. Mayo, “Design, structure, and stability of a hyperthermophilic protein variant,” Nat. Struct. Biol., vol. 5, pp. 470–475, 1998.
M. Oral and O. Kettani, “A linearization procedure for auadratic and cubic mixed-integer problems,” Operations Research, vol. 40, pp. S109–S116, 1990.
M. Oral and O. Kettani, “Reformulating nonlinear combinatorial optimization problems for higher computational efficiency,” European Journal of Operational Research, vol. 58, pp. 236–249, 1992.
P. Pardalos, H. Huang, and O. Prokopyev, “Multi-quadratic binary programming,” University of Florida, Research Report, 2004.
P. Pardalos and S. Jha, “Complexity of uniqueness and local search in quadratic 0-1 programming,” Operations Research Letters, vol. 11, pp. 119–123, 1992.
N. Pierce, J. Spriet, J. Desmet, and S. Mayo, “Conformational splitting: A more powerful criterion for dead-end elimination,” J. Computational Chemistry, vol. 21, pp. 999–1009, 2000.
N. Pierce and E. Winfree, “Protein design is NP-hard,” Protein Engineering., vol. 15, pp. 779–782, 2002.
S. Rao, “A novel In Silico sequence selection approach to the identidication of hβD-2 analogs with improved specificity,” Princeton University, Department of Chemical Engineering, Senior Thesis, 2004.
F. Richards, J. Caradonna, and H. Hellinga, “Construction of new ligand binding sites in proteins of known structure. II. grafting of a buried transition metal binding site into Escherichia coli thioredoxin,” J. Mol. Biol., vol. 222, pp. 787–803, 1991.
F. Richards and H. Hellinga, “Construction of new ligand binding sites in proteins of known structure. I. Computer-aided modeling of sites with pre-defined geometry,” J. Mol. Biol., vol. 222, pp. 763–785, 1991.
H. Sherali and W. Adams, A reformulation linearization technique for solving discrete and continuous nonconvex problems. Boston, MA: Kluwer Academic Publishing, 1999.
M. Shimaoka, J. Shifman, H. Jing, L. Takagi, S. Mayo, and T. Springer, “Computational design of an intergrin i domain stabilized in the open high affinity conformation,” Nat. Struct. Biol., vol. 7, pp. 674–678, 2000.
D. Tobi and R. Elber, “Distance-dependent pair potential for protein folding: Results from linear optimization,” Proteins, vol. 41, pp. 40–46, 2000.
D. Tobi, G. Shafran, N. Linial, and R. Elber, “On the design and analysis of protein folding potentials,” Proteins, vol. 40, pp. 71–85, 2000.
C. Voigt, D. Gordon, and S. Mayo, “Trading accuracy for speed: A quantitative comparison of search algorithms in protein sequence design,” J. Mol. Biol., vol. 299, pp. 789–803, 2000.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fung, H.K., Rao, S., Floudas, C.A. et al. Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design. J Comb Optim 10, 41–60 (2005). https://doi.org/10.1007/s10878-005-1859-8
Issue Date:
DOI: https://doi.org/10.1007/s10878-005-1859-8