By Topic

Frequent graph mining and its application to molecular databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nijssen, S. ; LIACS, Universiteit Leiden, Netherlands ; Kok, J.N.

Molecular fragment mining is a promising approach for discovering novel fragments for drugs. We investigate a method for mining fragments which consists of three phases: first, a preprocessing phase for turning molecular databases into graph databases; second, the Gaston frequent graph mining phase for mining frequent paths, free trees and cyclic graphs; and third, a postprocessing phase in which redundant frequent fragments are removed. We devote most of our attention to the frequent graph mining phase, as this phase is computationally the most demanding, but also look at the other phases.

Published in:

Systems, Man and Cybernetics, 2004 IEEE International Conference on  (Volume:5 )

Date of Conference:

10-13 Oct. 2004