Sensible method for updating motif instances in an increased biological network

Abstract

Listen

Translate article

A network motif is defined as an over-represented subgraph pattern in a network. Network motif based techniques have been widely applied in analyses of biological networks such as transcription regulation networks (TRNs), protein–protein interaction networks (PPIs), and metabolic networks. The detection of network motifs involves the computationally expensive enumeration of subgraphs, NP-complete graph isomorphism testing, and significance testing through the generation of many random graphs to determine the statistical uniqueness of a given subgraph. These computational obstacles make network motif analysis unfeasible for many real-world applications. We observe that the fast growth of biotechnology has led to the rapid accretion of molecules (vertices) and interactions (edges) to existing biological network databases. Even with a small percentage of additions, revised networks can have a large number of differing motif instances. Currently, no existing algorithms recalculate motif instances in ‘updated’ networks in a practical manner. In this paper, we introduce a sensible method for efficiently recalculating motif instances by performing motif enumeration from only updated vertices and edges. Preliminary experimental results indicate that our method greatly reduces computational time by eliminating the repeated enumeration of overlapped subgraph instances detected in earlier versions of the network. The software program implementing this algorithm, defined as SUNMI (Sensible Update of Network Motif Instances), is currently a stand-alone java program and we plan to upgrade it as a web-interactive program that will be available through http://faculty.washington.edu/kimw6/research.htm in near future. Meanwhile it is recommended to contact authors to obtain the stand-alone SUNMI program.