Skip to main content
Fig. 6 | BMC Medical Genomics

Fig. 6

From: Clustering analysis of microRNA and mRNA expression data from TCGA using maximum edge-weighted matching algorithms

Fig. 6

An illustration of partitioning V(G) into a number of bipartite subgraphs. The input edge-weighted graph is bipartite, i.e., V(G) = V(A)∪V(B) and all edges are linked between disjoint parts A and B, where part A represents miRNAs, with (upper) nodes denoted by squares, and part B represents mRNAs, with (lower) nodes denoted by circles

Back to article page