Fig. 5From: CoSREM: a graph mining algorithm for the discovery of combinatorial splicing regulatory elementsAn example of an MCStree. The example shows a part of the tree where θ=100. The dotted boxes means that this MCS set does not satisfy the user threshold T(M)≥θ, where T(M) is the number of shared exons between the MCSs, and this branch will be pruned. all vertices with distance from the root ≥β threshold will be considered as potential MCS collectionBack to article page