Fig. 10
Illustrated example of constructing star-graphs. The miRNA is the internal node (denoted by a square) of a star graph and the mRNA is the leaf (denoted by a circle) of a star graph. After the first round application of the Hungarian algorithm, disjoint K1,1 stars (S1) are produced. After the second round application of the Hungarian algorithm, disjoint K1,2 stars (S2) are formed. The internal node of each K1,2 star (S2) is the same as each corresponding K1,1 star (S1), respectively. One of the leaves of each K1,2 star (S2) is derived from each corresponding K1,1 star (S1), respectively. After the third iteration of Hungarian algorithm, disjoint K1,3 stars (S3) are produced. The internal node of each K1,3 star (S3) is the same as the corresponding K1,1 star (S1) and K1,2 star (S2), respectively. Two of the leaves of each K1,3 star (S3) are derived from the corresponding K1,2 star (S2). Eventually, disjoint K1,k stars (Sk) are constructed. The zero-value-weighted edges were removed from all the star graphs