Motif Discovery of Protein-Protein Interaction using Minimum Spanning Tree

In protein Interaction Networks, counting subgraph is a tedious task. From the list of non induced occurrence of the subgraph, motif topology calculated by using Combi Motif and Slider techniques. But, this approach was taken more time to execute. To reduce the execution time, the minimum weight value between the nodes, the Minimum spanning tree concept proposed. Prim’s method implemented with the greedy technique (as Kruskal’s algorithm) to calculate the minimum path between the nodes in the Protein interaction network. This technique uses to compare the similarity of the minimum spanning tree approach. Initially, this algorithm has discovered the path then calculated the weight matrix and found the minimum weight value. From the computational experiments, the proposed approach of MST providing better results in terms of time consumption and accuracy to count the motif pattern in the network of the interacted proteins.