Advanced pruning strategies to speed up mining closed molecular fragments
Christian Borgelt, Thorsten Meinl, Michael R. Berthold · 2005
In years, several algorithms for mining frequent subgraphs in graph databases have been proposed, with a major application area being the discovery of frequent substructures of biomolecules. Unfortunately, most of these algorithms still struggle with fairly long execution times if larger substructures or molecular fragments are desired. We describe two advanced pruning strategies - equivalent sibling pruning and perfect extension pruning - that can be used to speed up the MoFa algorithm (introduced in C. Borgelt and M.R. Berthold, (2002)) in the search for closed molecular fragments, as we demonstrate with experiments on the NCI's HIV database.