skip to main content
10.1145/3071178.3071197acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Solving structures of pigment-protein complexes as inverse optimization problems using decomposition

Authors Info & Claims
Published:01 July 2017Publication History

ABSTRACT

Simple optical spectroscopy measurements, namely circular dichroism (CD) and absorption spectra of interacting pigments, can be used for deriving details of their molecular geometry. Unlike X-ray crystallography and NMR that provide highly detailed structural information but consume time and resources, optical spectroscopic measurements that provide valuable information on local interactions are fast, and easy to perform. Unfortunately, structural information may be extracted from optical spectra only upon solving an ill-defined inverse-problem (spectrum → structure). In this paper, we present a computational approach for addressing this problem, relying on simulation-based optimization. We introduce quantum theoretical simulations of both CD and absorption spectra of interacting chlorophylls, integrated with an effective graphical user interface to facilitate an expert's estimation of the chlorophyll geometry. The inverse-problem is then efficiently solved by decomposing it into two approximately independent subproblems and employing two different derandomized Evolution Strategies, while relying on the expert's initial search-point. Our approach is implemented for deriving the geometry of interacting chlorophylls incorporated within natural proteins. It is then demonstrated to retrieve chlorophyll geometries with low errors when compared to the respective geometries determined to near-atomic resolution by X-ray crystallography. The observations are reported and investigated in the light of non-uniqueness and uncertainty.

References

  1. Dirk V. Arnold. 2002. Noisy Optimization with Evolution Strategies. Springer, Berlin. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Thomas Bäck. 1996. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, NY, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Thomas Bäck, Chrisophe Foussette, and Peter Krause. 2013. Contemporary Evolution Strategies. Springer-Verlag Berlin Heidelberg. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Jonathan F. Bard. 1998. Practical Bilevel Optimization: Algorithms and Applications. Springer Science+Business, Dordrecht, The Netherlands. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Dominika Bednarczyk, Orly Dym, Vadivel Prabahar, Yoav Peleg, Douglas H. Pike, and Dror Noy. 2016. Fine Tuning of Chlorophyll Spectra by Protein-Induced Ring Deformation. Angewandte Chemie International Edition 55, 24 (2016), 6901--6905.Google ScholarGoogle ScholarCross RefCross Ref
  6. Hans-Georg Beyer and Hans-Paul Schwefel. 2002. Evolution Strategies A Comprehensive Introduction. Natural Computing: An International Journal 1, 1 (2002), 3--52. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Seth Cooper, Firas Khatib, Adrien Treuille, Janos Barbero, Jeehyung Lee, Michael Beenen, Andrew Leaver-Fay, David Baker, and Zoran Popovic. 2010. Predicting protein structures with a multiplayer online game. Nature 466 (2010), 756--760. Issue 7307.Google ScholarGoogle ScholarCross RefCross Ref
  8. Thanh-Chung Dinh and Thomas Renger. 2015. Towards an exact theory of linear absorbance and circular dichroism of pigment-protein complexes: Importance of non-secular contributions. The Journal of Chemical Physics 142, 3 (2015).Google ScholarGoogle ScholarCross RefCross Ref
  9. Abram L. Friesen and Pedro Domingos. 2015. Recursive Decomposition for Nonconvex Optimization. In Proceedings of the 24th International Conference on Artificial Intelligence (IJCAI'15). AAAI Press, 253--259. http://dl.acm.org/citation.cfm?id=2832249.2832284 Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Nikolaus Hansen, Dirk V. Arnold, and Anne Auger. 2015. Springer Handbook of Computational Intelligence. Springer Berlin Heidelberg, Berlin, Heidelberg, Chapter Evolution Strategies, 871--898.Google ScholarGoogle Scholar
  11. Nikolaus Hansen and Stefan Kern. 2004. Evaluating the CMA Evolution Strategy on Multimodal Test Functions. In Parallel Problem Solving from Nature - PPSN VIII (Lecture Notes in Computer Science), Vol. 3242. Springer-Verlag, Berlin Heidelberg, 282--291.Google ScholarGoogle Scholar
  12. Nikolaus Hansen and Andreas Ostermeier. 2001. Completely Derandomized Self-Adaptation in Evolution Strategies. Evolutionary Computation 9, 2 (2001), 159--195. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M.H. Koolhaas, G. van der Zwan, F. van Mourik, and R. van Grondelle. 1997. Spectroscopy and structure of bacteriochlorophyll dimers. I. Structural consequences of nonconservative circular dichroism spectra. Biophysical Journal 72, 4 (1997), 1828--1841.Google ScholarGoogle ScholarCross RefCross Ref
  14. Richard Liboff. 2002. Introductory Quantum Mechanics (4th Edition). Addison-Wesley, San Francisco, CA, USA.Google ScholarGoogle Scholar
  15. Zhichao Lu, Kalyanmoy Deb, and Ankur Sinha. 2016. Finding Reliable Solutions in Bilevel Optimization Problems Under Uncertainties. In Proceedings of the Genetic and Evolutionary Computation Conference 2016 (GECCO '16). ACM, New York, NY, USA, 941--948. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. A. L. Marques and E. K. U. Gross. 2004. TIME-DEPENDENT DENSITY FUNCTIONAL THEORY. Annual Review of Physical Chemistry 55, 1 (2004), 427--455. PMID: 15117259.Google ScholarGoogle ScholarCross RefCross Ref
  17. Andreas Ostermeier, Andreas Gawelczyk, and Nikolaus Hansen. 1994. Step-Size Adaptation Based on Non-Local Use of Selection Information. In Parallel Problem Solving from Nature - PPSN III (Lecture Notes in Computer Science), Vol. 866. Springer, 189--198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Raymond Ros and Nikolaus Hansen. 2008. A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity. In Parallel Problem Solving from Nature - PPSN X (Lecture Notes in Computer Science), Vol. 5199. Springer, 296--305.Google ScholarGoogle Scholar
  19. Günter Rudolph. 2012. Handbook of Natural Computing: Theory Experiments, and Applications. Springer-Verlag, Berlin-Heidelberg, Germany, Chapter Evolutionary Strategies, 673--698.Google ScholarGoogle Scholar
  20. Erich Runge and E. K. U. Gross. 1984. Density-Functional Theory for Time-Dependent Systems. Phys. Rev. Lett. 52 (Mar 1984), 997--1000. Issue 12.Google ScholarGoogle Scholar
  21. P. F. Rusch and J. P. Lelieur. 1973. Analytical moments of skewed Gaussian distribution functions. Analytical Chemistry 45, 8 (1973), 1541--1543.Google ScholarGoogle ScholarCross RefCross Ref
  22. Albert Tarantola. 2005. Inverse Problem Theory and Methods for Model Parameter Estimation. SIAM, Philadelphia, PA, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Jörgen Tind. 1991. Decomposition in Global Optimization. Journal of Global Optimization 1 (1991), 131--144.Google ScholarGoogle ScholarCross RefCross Ref
  24. Wilfred F. van Gunsteren, Jane R. Allison, Xavier Daura, Jožica Dolenc, Niels Hansen, Alan E. Mark, Chris Oostenbrink, Victor H. Rusu, and Lorna J. Smith. 2016. Deriving Structural Information from Experimentally Measured Data on Biomolecules. Angewandte Chemie International Edition 5 (2016), 2--23.Google ScholarGoogle Scholar
  25. Md Wahadoszamen, Iris Margalit, Anjue Mane Ara, Rienk van Grondelle, and Dror Noy. 2014. The role of charge-transfer states in energy transfer and dissipation within natural and artificial bacteriochlorophyll proteins. Nature Communications 5 (24 Oct 2014), 5287 EP -. Article.Google ScholarGoogle Scholar

Index Terms

  1. Solving structures of pigment-protein complexes as inverse optimization problems using decomposition

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference
      July 2017
      1427 pages
      ISBN:9781450349208
      DOI:10.1145/3071178

      Copyright © 2017 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 July 2017

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      GECCO '17 Paper Acceptance Rate178of462submissions,39%Overall Acceptance Rate1,669of4,410submissions,38%

      Upcoming Conference

      GECCO '24
      Genetic and Evolutionary Computation Conference
      July 14 - 18, 2024
      Melbourne , VIC , Australia

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader