Finding recurrent RNA structural networks with fast maximal common subgraphs of edge-colored graphs
Fig 4
Illustration of the extension process.
This figure illustrates the extension process from a “starting point” (here ((g0, h0), (g0, h0)), in blue). We first consider the neighbors of g0 and h0 (in purple). Thanks to the PEC, there is only one way to match them. We then consider the neighbors of g1 and h1 (in green). We match g5 and h5 but discover that their neighborhoods are not compatible. At this point the behaviours of the three algorithms differ. This discovery implies that the matching cannot be extended to cover all of G so the Graph Isomorphism and Subgraph Isomorphism will abandon it and pass on to another “starting point”. The All Maximal Common Subgraphs on the contrary will take note of this discrepancy and keep extending the matching nevertheless. This extension will output a maximal common subgraph of G and H and a new branch will be created to explore the alternative solution suggested by the discrepancy found.