TY - GEN
T1 - Protein design by multiobjective optimization
T2 - 2017 Genetic and Evolutionary Computation Conference, GECCO 2017
AU - Belure, Sandeep V.
AU - Shir, Ofer M.
AU - Nanda, Vikas
N1 - Publisher Copyright:
© 2017 ACM.
PY - 2017/7/1
Y1 - 2017/7/1
N2 - Traditional simulation-based protein design considers energy minimization of candidate conformations as a singleobjective combinatorial optimization problem. In this paper we consider a challenging protein design problem, producing twelve protein species based on collagen that uniquely assort into four groups of three: a problem defined herein as a 4-level heterotrimer. We formulate a bi-objective combinatorial minimization problem that targets both stability and specificity of the 4-level heterotrimer. In order to approximate its Pareto frontier, we utilize both evolutionary and non-evolutionary approaches, operating in either Pareto or aggregation fashions. Our practical observations suggest that the SMS-EMOA with Evolution Strategies' operators is more effective than standard heuristics deployed in computational protein design, such as Simulated Annealing, Replica Exchange or the Canonical Genetic Algorithm. We investigate the attained Pareto optimal sets using Barrier Tree analysis, aiming to provide insights into the chemical search-space, as well as to explain the observed algorithmic trends. In particular, we identify Replica Exchange as a promising non-evolutionary technique for this problem class, due to its efficient exploration capabilities. Overall, a common high-level protocol for simultaneous landscape analysis of evolutionary and non-evolutionary search methodologies is put forward for the first time.
AB - Traditional simulation-based protein design considers energy minimization of candidate conformations as a singleobjective combinatorial optimization problem. In this paper we consider a challenging protein design problem, producing twelve protein species based on collagen that uniquely assort into four groups of three: a problem defined herein as a 4-level heterotrimer. We formulate a bi-objective combinatorial minimization problem that targets both stability and specificity of the 4-level heterotrimer. In order to approximate its Pareto frontier, we utilize both evolutionary and non-evolutionary approaches, operating in either Pareto or aggregation fashions. Our practical observations suggest that the SMS-EMOA with Evolution Strategies' operators is more effective than standard heuristics deployed in computational protein design, such as Simulated Annealing, Replica Exchange or the Canonical Genetic Algorithm. We investigate the attained Pareto optimal sets using Barrier Tree analysis, aiming to provide insights into the chemical search-space, as well as to explain the observed algorithmic trends. In particular, we identify Replica Exchange as a promising non-evolutionary technique for this problem class, due to its efficient exploration capabilities. Overall, a common high-level protocol for simultaneous landscape analysis of evolutionary and non-evolutionary search methodologies is put forward for the first time.
KW - Barrier trees
KW - Combinatorial landscapes
KW - Evolutionary algorithms
KW - Negative slope coefficients
KW - Protein design
KW - Replica exchange
KW - Simulated annealing
KW - Simulation-based multiobjective optimization
UR - http://www.scopus.com/inward/record.url?scp=85026405352&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85026405352&partnerID=8YFLogxK
U2 - 10.1145/3071178.3071268
DO - 10.1145/3071178.3071268
M3 - Conference contribution
AN - SCOPUS:85026405352
T3 - GECCO 2017 - Proceedings of the 2017 Genetic and Evolutionary Computation Conference
SP - 1081
EP - 1088
BT - GECCO 2017 - Proceedings of the 2017 Genetic and Evolutionary Computation Conference
PB - Association for Computing Machinery, Inc
Y2 - 15 July 2017 through 19 July 2017
ER -