5573547
doi
10.35940/ijeat.B4576.029320
oai:zenodo.org:5573547
Blue Eyes Intelligence Engineering & Sciences Publication(BEIESP)
Publisher
D. Ramyachitra
, Assistant Professor, Department of Computer Science, Bharathiar University, Coimbatore, Tamilnadu
E. Pavithravishalini
Ph.D. Research Scholar, Department of Computer Science, Bharathiar University, Coimbatore, Tamilnadu
Motif Discovery of Protein-Protein Interaction using Minimum Spanning Tree
P. Lakshmi
Ph.D. Research Scholar, Department of Computer Science, Bharathiar University, Coimbatore, Tamilnadu
issn:2249-8958
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
Motif, Protein interaction Network, Minimum Spanning Tree, Graph, Sub tree
<p>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.</p>
Zenodo
2020-02-29
info:eu-repo/semantics/article
5573546
1634392126.905143
1281186
md5:1c6e31c04f69031dc10662b9d73e6c31
https://zenodo.org/records/5573547/files/B4576129219.pdf
public
2249-8958
Is cited by
issn
International Journal of Engineering and Advanced Technology (IJEAT)
9
3
990-994
2020-02-29