Abstract
Structure-based virtual screening is a technology increasingly used in drug discovery. Although successful at estimating binding modes for input ligands, these technologies are less successful at ranking true hits correctly by binding free energy. This chapter presents the automated removal of false positives from virtual hit sets, by evolving a post docking filter using Cartesian Genetic Programming(CGP). We also investigate characteristics of CGP for this problem and confirm the absence of bloat and the usefulness of neutral drift.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Afshar, Mohammad and Morley, S. David (2004). Validation of an empirical rna-ligand scoring function for fast flexible docking using ribodock(r). J. Comput.-Aided Mol. Design, accepted.
Ashmore, Laurence (2000). An investigation into cartesian genetic programming within the field of evolutionary art. Technical report, Final year project, http://www.gaga.demon.co.uk/evoart.htm. Department of Computer Science, University of Birmingham.
Garmendia-Doval, A. Beatriz, Morley, S. David, and Juhos, Szilvester (2004). Post docking filtering using cartesian genetic programming. In Liardet, P., Collet, P., Funlupt, C., Lutton, E., and Schoenauer, M., editors, Artificial Evolution, volume 2936 of Lecture Notes in Computer Science, pages 189–200. Springer.
Knowles, Joshua D. and Watson, Richard A. (2002). On the utility of redundant encodings in mutation-based evolutionary search. In J.-J. Merelo Guervós, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacañas, H.-P. Schwefel, editor, Parallel Problem Solving from Nature-PPSN VII, 7th International Conference, Granada, Spain, September 7–11, 2002. Proceedings, number 2439 in Lecture Notes in Computer Science, LNCS, page 88 ff. Springer-Verlag.
Lyne, Paul D. (2002). Structure-based virtual screening: an overview. Drug Discovery Today, 7(20): 1047–1055.
Miller, Julian (2001). What bloat? cartesian genetic programming on boolean problems. In Goodman, Erik D., editor, 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers, pages 295–302, San Francisco, California, USA.
Miller, Julian F. (1999). An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach. In Banzhaf, Wolfgang, Daida, Jason, Eiben, Agoston E., Garzon, Max H., Honavar, Vasant, Jakiela, Mark, and Smith, Robert E., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1135–1142, Orlando, Florida, USA. Morgan Kaufmann.
Miller, Julian F. (2003). Evolving developmental programs for adaptation, morphogenesis, and self-repair. In Banzhaf, Wolfgang, Christaller, Thomas, Dittrich, Peter, Kim, Jan T, and Ziegler, Jens, editors, Advances in Artificial Life, ECAL2003, Proceedings, volume 2801 of Lecture Notes in Artificial Intelligence, pages 256–265. Springer.
Miller, Julian F. and Banzhaf, Wolfgang (2003). Evolving the program for a cell: from French flags to boolean circuits. In Kumar, Sanjeev and Bentley, Peter J., editors, On Growth, Form and Computers, pages 278–301. Academic Press.
Miller, Julian F., Job, Dominic, and Vassilev, Vesselin K. (2000a). Principles in the evolutionary design of digital circuits-part I. Genetic Programming and Evolvable Machines, l(l/2):7–35.
Miller, Julian F., Job, Dominic, and Vassilev, Vesselin K. (2000b). Principles in the evolutionary design of digital circuits-part II. Genetic Programming and Evolvable Machines, 1(3):259–288.
Miller, Julian F. and Thomson, Peter (2000). Cartesian genetic programming. In Poli, Riccardo, Banzhaf, Wolfgang, Langdon, William B., Miller, Julian F., Nordin, Peter, and Fogarty, Terence C., editors, Genetic Programming, Proceedings of EuroGP’2000, volume 1802 of LNCS, pages 121–132, Edinburgh. Springer-Verlag.
Miller, Julian F. and Thomson, Peter (2003). A developmental method for growing graphs and circuits. In Tyrrell, Andy M., Haddow, Pauline C, and Torresen, Jim, editors, Evolvable Systems: From Biology to Hardware, Fifth International Conference, ICES 2003, volume 2606 of LNCS, pages 93–104, Trondheim, Norway. Springer-Verlag.
Miller, Julian F., Thomson, Peter, and Fogarty, Terence (1997). Designing electronic circuits using evolutionary algorithms arithmetic circuits: A case study. In Quagliarella, D., Périaux, J., Poloni, C., and Winter, G., editors, Genetic Algorithms and Evolution Strategies in Engineering and Computer Science. Recent Advances and Industrial Applications. John Wiley and Sons.
Morley, S. David, Juhos, Szilveszter, and Garmendia-Doval, A. Beatriz (2004). in preparation.
Nordin, Peter and Banzhaf, Wolfgang (1995). Complexity compression and evolution. In Eshelman, L., editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 310–317, Pittsburgh, PA, USA. Morgan Kaufmann.
Rothermich, Joseph A. and Miller, Julian F. (2002). Studying the emergence of multicellularity with cartesian genetic programming in artificial life. In Cantú-Paz, Erick, editor, Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), pages 397–403, New York, NY. AAAI.
Rothermich, Joseph A., Wang, Fang, and Miller, Julian F. (2003). Adaptivity in cell based optimization for information ecosystems. In Press, IEEE, editor, Proceedings of the 2003 Congress on Evolutionary Computation, pages 490–497, Camberra.
Schwefel, H. P. (1965). Kybernetische evolution als strategie der experimentelen forschung in der stromungstechnik. Master’s thesis, Technical University of Berlin.
Sekanina, Lukas (2004). Evolvable Components: From Theory to Hardware Implementations. Springer-Verlag.
Smith, Ryan, Hubbard, Roderick E., Gschwend, Daniel A., Leach, Andrew R., and Good, Andrew C. (2003). Analysis and optimization of structure-based virtual screening protocols (3). new methods and old problems in scoring function design. J. Mol. Graphics Mod., 22:41–53.
Stahl, Martin and Böhm, Hans-Joachim (1998). Development of filter functions for protein-ligand docking. J. Mol. Graphics Mod., 16:121–132.
Vassilev, Vesselin K. and Miller, Julian F. (2000). The advantages of landscape neutrality in digital circuit evolution. In Proceedings of the Third International Conference on Evolvable Systems, pages 252–263. Springer-Verlag.
Voss, Mark S. (2003). Social programming using functional swarm optimization. In IEEE Swarm Intelligence Symposium (SIS03).
Voss, Mark S. and James C. Howland, III (2003). Financial modelling using social programming. In FEA 2003: Financial Engineering and Applications, Banff, Alberta.
Walker, James A. and Miller, Julian F. (2004). Evolution and acquisition of modules in cartesian genetic programming. In Keijzer, Maarten, O’Reilly, Una-May, Lucas, Simon M., Costa, Ernesto, and Soule, Terence, editors, Proceedings of the Seventh European Conference on Genetic Programming, volume 3003 of LNCS, pages 187–197. Springer-Verlag.
Yu, Tina and Miller, Julian (2001). Neutrality and the evolvability of boolean function landscape. In Miller, Julian F., Tomassini, Marco, Lanzi, Pier Luca, Ryan, Conor, Tettamanzi, Andrea G. B., and Langdon, William B., editors, Genetic Programming, Proceedings of EuroGP’2001, volume 2038 of LNCS, pages 204–217, Lake Como, Italy. Springer-Verlag.
Yu, Tina and Miller, Julian F. (2002). Needles in haystacks are not hard to find with neutrality. In Foster, James A., Lutton, Evelyne, Miller, Julian, Ryan, Conor, and Tettamanzi, Andrea G. B., editors, Genetic Programming, Proceedings of the 5th European Conference, EuroGP 2002, volume 2278 of LNCS, pages 13–25, Kinsale, Ireland. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Garmendia-Doval, A.B., Miller, J.F., Morley, S.D. (2005). Cartesian Genetic Programming and the Post Docking Filtering Problem. In: O’Reilly, UM., Yu, T., Riolo, R., Worzel, B. (eds) Genetic Programming Theory and Practice II. Genetic Programming, vol 8. Springer, Boston, MA. https://doi.org/10.1007/0-387-23254-0_14
Download citation
DOI: https://doi.org/10.1007/0-387-23254-0_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23253-9
Online ISBN: 978-0-387-23254-6
eBook Packages: Computer ScienceComputer Science (R0)