Protein-Protein Interaction and Prediction of neighboring residues is challenging. This paper revitalize, intent to resolve and to associate with the interaction of multiple proteins that indicates the multiple protein network. But here the interrupt deals with the neighboring residues that is amino acids. The algorithm that used is directed for progression to their neighboring residues and introduce the inclination that the finding of the neighboring residues is a little bit easy and to reduce the elapse time that compared to the existing. To measure the inadequacy of the network, illustrate and compare to the normal time of the protein network. The proposed algorithm clearly deemed the network by using Hamilton Path & Minimum Change Algorithm (HDMCA) to manifest. First, the algorithm HDMCA, a traceable path that impact all through the network that is neighboring network except the starting node and ending node. This algorithm is an undirected graph so starting protein and ending protein are chosen by patron in the individual binding residues.
[1]
Claudio Gentile,et al.
Random Spanning Trees and the Prediction of Weighted Graphs
,
2010,
ICML.
[2]
Gerald L. Thompson,et al.
A successful algorithm for the undirected Hamiltonian path problem
,
1985,
Discret. Appl. Math..
[3]
L. Mirny,et al.
Protein complexes and functional modules in molecular networks
,
2003,
Proceedings of the National Academy of Sciences of the United States of America.
[4]
Hui Li,et al.
Predicting Protein-Protein Interactions Based on PPI Networks
,
2012
.
[5]
E. Nagarajan,et al.
Knowledge Abstraction from MIMIC II using Apriori Algorithm for Clinical Decision Support System
,
2015
.
[6]
Hong Sun,et al.
Smolign: A Spatial Motifs-Based Protein Multiple Structural Alignment Method
,
2012,
IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[7]
Gesine Reinert,et al.
Predicting and Validating Protein Interactions Using Network Structure
,
2008,
PLoS Comput. Biol..