Skip to main content
Fig. 6 | BMC Bioinformatics

Fig. 6

From: CoSREM: a graph mining algorithm for the discovery of combinatorial splicing regulatory elements

Fig. 6

An example of generating SRE sets. The MCS collection here contains three subgraphs representing enhancers. Applying a modified depth first traversal will result in the longest sequence from each subgraph. The last step is to locate the three sequences in the associated exon set. If any of the sequences are overlapping in an exon, they will be merged in one longer sequence which results in new SRE sets. We then count the number of exons each new SRE set resides in. The SRE set that resides in at least 100 exons will be included in the final result as the set highlighted with a red rectangle

Back to article page