A METHOD FOR FINDING THE PATHWAY IN A NETWORK HAVING THE HIGHEST HOMOLOGY SCORE WITH A QUERY PATHWAY

摘要

The present invention comprises the steps of: a) obtaining a route graph represented by a point and a set of lines connecting the point and the point, respectively, to the target network and any known query path to be compared with the target network, wherein the points represent each protein, The line represents the protein's interaction with the protein; b) comparing the homology between the query pathway and the protein corresponding to each point of the target network, so that any protein A of the query pathway and any protein u of the target network are at least equal to the set value In the case of having, the two proteins A and u are represented by one associated point A / u to obtain a global alignment graph: c) including any point Ai derived from the query path in the global alignment graph. Mapping all associated points A / u to one virtual point to obtain a virtual global alignment graph; d) finding all possible Hamilton paths from the obtained virtual global alignment graph and directing the lines of the global alignment graph according to the order of the points in each Hamilton path to obtain a directional acyclic circular alignment graph, wherein the Hamilton path is A path passing through all points of the virtual global alignment graph once; And e) selecting a directional acyclic route having the highest homology score among the directional acyclic global alignment graphs.;Homology, pathways, networks, proteins, interactions