Skip to main content

Pharmacophore Knowledge Refinement Method in the Chemical Structure Space

  • Conference paper
Discovery Science (DS 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4755))

Included in the following conference series:

  • 1292 Accesses

Abstract

Studies on the structure–activity relationship of drugs essentially require a relational learning scheme in order to extract meaningful chemical subgraphs; however, most relational learning systems suffer from a vast search space. On the other hand, some propositional logic mining methods use the presence or absence of chemical fragments as features, but rules so obtained give only crude knowledge about part of the pharmacophore structure. This paper proposes a knowledge refinement method in the chemical structure space for the latter approach. A simple hill-climbing approach was shown to be very useful if the seed fragment contains the essential characteristic of the pharmacophore. An application to the analysis of dopamine D1 agonists is discussed as an illustrative example.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Daylight Chemical Information Systems: Daylight Theory: SMARTS Manual(2004), http://www.daylight.com/dayhtml/doc/theory/theory.smarts.html

  2. Karwath, A., De Raedt, L.: SMIREP: Predicting Chemical Activity from SMILES. Journal of Chemical Information and Modeling 46(6), 2432–2444 (2006)

    Article  Google Scholar 

  3. King, R.D., Muggleton, S.H., Srinivasan, A., Sternberg, M.J.E.: Structure–activity relationships derived by machine learning: The use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming. Proceedings of the National Academy of Sciences 93(1), 438–442 (1996)

    Article  Google Scholar 

  4. MDL: Drug Data Report, MDL, 2001.1 (2001)

    Google Scholar 

  5. Okada, T.: Rule induction in cascade model based on sum of squares decomposition. In: Żytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, pp. 468–474. Springer, Heidelberg (1999)

    Google Scholar 

  6. Okada, T., Yamakawa, M., Niitsuma, H.: Spiral mining using attributes from 3D molecular structures. In: Tsumoto, S., Yamaguchi, T., Numao, M., Motoda, H. (eds.) AM 2003. LNCS (LNAI), vol. 3430, pp. 287–302. Springer, Heidelberg (2005)

    Google Scholar 

  7. Okada, T.: Mining from chemical graphs. In: Holder, L.B., Cook, D.J. (eds.) Mining Graph Data, pp. 347–379. Wiley–Interscience, Chichester (2006)

    Google Scholar 

  8. Weininger, D.: SMILES, a chemical language and information system. 1. Introduction and encoding rules. Journal of Chemical Information and Computer Science 28(1), 31–36 (1988)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Vincent Corruble Masayuki Takeda Einoshin Suzuki

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujishima, S., Takahashi, Y., Okada, T. (2007). Pharmacophore Knowledge Refinement Method in the Chemical Structure Space. In: Corruble, V., Takeda, M., Suzuki, E. (eds) Discovery Science. DS 2007. Lecture Notes in Computer Science(), vol 4755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75488-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75488-6_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75487-9

  • Online ISBN: 978-3-540-75488-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics