Discovering Distinct Functional Modules of Specific Cancer Types Using Protein-Protein Interaction Networks

Algorithm 2

Verify_matching (graph , list of matchingGraphs).

()   for every graph mg in matchingGraphs

()   find node with the highest degree in , denoted as , mark as visited

()   look for node in mg with the same label and degree as

()   if such node doesn’t exist

()    skip to next loop

()   else

()    while there are nodes remaining unvisited in

()     find node connected node and with the highest degree

()     or find node with the highest degree if no node is connected to

()   assign the node to , mark as visited

()   look for node in mg with the same label and degree as

()   if such node doesn’t exist

()    Skip to next loop on line ()

()   else do nothing

()  end while

() if all nodes in are visited,

()  mg is a matching subgraph, is not distinct, halt

() end for

() include into distinct modules