Finding recurrent RNA structural networks with fast maximal common subgraphs of edge-colored graphs
Fig 6
Simplified display of the full pipeline.
The RNA 2D structure graphs given as input are pre-processed for the sake of optimization. Each pair of graphs in the pre-processed data is then given to the maximal common subgraphs algorithm as input and the output is post-processed into partial sets of . All partial sets of
are finally merged into the complete set of
which is the output of the whole pipeline.