Parallel algorithms for mining frequent structural motifs in scientific data

Chao Wang, Srinivasan Parthasarathy
2004 Proceedings of the 18th annual international conference on Supercomputing - ICS '04  
Discovery of important substructures from molecules is an important data mining problem. The basic motivation is that the structure of a molecule has a role to play in its biochemical function. There is interest in finding important, often recurrent, substructures both within a single molecule and across a class of molecules. Recently, we have developed a general purpose suite of algorithms -the MotifMiner Toolkit -that can mine for structural motifs in a wide area of biomolecular datasets.
more » ... cular datasets. While the algorithms have proven to be extremely useful in their ability to identify novel substructures, the algorithms themselves are quite time consuming. There are two reasons for this: i) inherently the algorithm suffers from the curse of subgraph isomorphism; and ii) handling noise effects (e.g. protein structure data) results in a significant slowdown. To address this problem in this paper we propose parallelization strategies in a cluster environment for the above algorithms. We identify key optimizations that handle load imbalance, scheduling, and communication overheads. Results show that the optimizations are quite effective and that we are able to obtain good speedup on moderate sized clusters.
doi:10.1145/1006209.1006215 dblp:conf/ics/WangP04 fatcat:glmeswhusjailk44wdzuauz4vu