Title: An efficiently computable graph-based metric for the classification of small molecules
Authors: Schietgat, Leander ×
Ramon, Jan
Bruynooghe, Maurice
Blockeel, Hendrik #
Issue Date: Oct-2008
Publisher: Springer
Host Document: Lecture Notes in Computer Science vol:5255 pages:197-209
Conference: International Conference on Discovery Science edition:11 location:Budapest, Hungary date:13-16 October 2008
Abstract: In machine learning, there has been an increased interest in metrics on structured data. The application we focus on is drug discovery. Although graphs have become very popular for the representation of molecules, a lot of operations on graphs are NP-complete. Representing the molecules as outerplanar graphs, a subclass within general graphs, and using the block-and-bridge preserving subgraph isomorphism, we define a metric and we present an algorithm for computing it in polynomial time. We evaluate this metric and more generally also the block-and-bridge preserving matching operator on a large dataset of molecules, obtaining favorable results.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
schietgat_ds08.pdfMain article Published 176KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science