Open Access Open Access  Restricted Access Subscription Access

A Novel Technique for Analysis of Protein to Protein Interaction using EfficientMinimum Spanning Tree Techniques


Affiliations
1 Department of Computer Science Engineering, Dr. M.G.R. Educational and Research Institute University, Chennai - 600095, Tamil Nadu, India
 

In this research article, the network concepts are proving extensive study of gene function, Protein–Protein Interaction and biochemical communication pathway. Method/Analysis: The understanding of huge-size protein network data is depending on skill to identify significant cluster in its data sets, which is a computationally precise task. This brings a new scope to carry out research work which helps for determining new paths in graph and assist to solve the problem for identifying pathways in protein interaction networks. Findings: This idea breaks through to implement new technique called efficient spanning tree algorithm for finding an efficient pathway with in networks under numerous biologically motivated constraints. This method helps to hunt for protein pathways over Protein-Protein Interaction network. Application/Improvements: The analysis results confirmed that the proposed algorithm is capable of restructuring the signal pathways and to identify well qualified paths in an unsupervised method.

Keywords

Algorithm, Cluster, E-MST, Protein.
User

Abstract Views: 141

PDF Views: 0




  • A Novel Technique for Analysis of Protein to Protein Interaction using EfficientMinimum Spanning Tree Techniques

Abstract Views: 141  |  PDF Views: 0

Authors

S . Jeyabalan
Department of Computer Science Engineering, Dr. M.G.R. Educational and Research Institute University, Chennai - 600095, Tamil Nadu, India
V. Cyril Raj
Department of Computer Science Engineering, Dr. M.G.R. Educational and Research Institute University, Chennai - 600095, Tamil Nadu, India

Abstract


In this research article, the network concepts are proving extensive study of gene function, Protein–Protein Interaction and biochemical communication pathway. Method/Analysis: The understanding of huge-size protein network data is depending on skill to identify significant cluster in its data sets, which is a computationally precise task. This brings a new scope to carry out research work which helps for determining new paths in graph and assist to solve the problem for identifying pathways in protein interaction networks. Findings: This idea breaks through to implement new technique called efficient spanning tree algorithm for finding an efficient pathway with in networks under numerous biologically motivated constraints. This method helps to hunt for protein pathways over Protein-Protein Interaction network. Application/Improvements: The analysis results confirmed that the proposed algorithm is capable of restructuring the signal pathways and to identify well qualified paths in an unsupervised method.

Keywords


Algorithm, Cluster, E-MST, Protein.



DOI: https://doi.org/10.17485/ijst%2F2016%2Fv9i41%2F124755