RNA Subgraphs

 

This RNA Subgraph Program finds the largest available subgraph of a given RNA using matrices representations. Specifically, it allows users to upload two CT files, and the program finds the largest common RNA subgraph.

 

Using the Tree Graph Representation:

You can send two "CT" input files to be compared for the common subgraphs. The program shows the Graph IDs and the highest common subgraph. Please note that pseudoknots can not be represented using the Tree Graphs.


 

File (1):
File (2):

 

Using the Dual Graph Representation:

You can send two "CT" input files to be compared for the common subgraphs. The program shows the Graph IDs and the highest common subgraph.




File (1):
File (2):

 

 

Current Limitations:

  • When computing the common subgraphs, number of Vertices is limited to 10 for tree graphs and 9 for dual graphs
  • Please make sure files extenstion are ".ct"

 

Page | by Dr. Radut