A Genetic Algorithm based Protein signal Pathway Analysis

Abstract

In recent research, the analysis of protein path signaling is one of the complex tasks due to topological changes and hence to find the shortest path routing in protein path signaling turns out to be a dynamic problem. There are numerous algorithms available to find shortest path which is having a polynomial time complexity. These algorithms are successful for conventional protein analysis. But, they demonstrate an intolerable high processing complexity in real-time connections linking swiftly due to changes in pathway signaling. Hence the genetic algorithm has been chosen to solve this optimal route shortening in protein pathway signaling. As genetic based solution is a heuristic search algorithm, it is found to be one of the best algorithms for dynamic optimization problem. Hence, in this proposed genetic algorithm and its operators are applied in the existing minimum spanning tree is solved this dynamic shortest path routing problem. Here buffer space was chosen as the metric for choosing the best path which will result in the improved delivery ratio and reduced end to end delay.