Skip to main content
Figure 2 | BMC Bioinformatics

Figure 2

From: On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types

Figure 2

Bicliques, cliques, and frequent closed itemsets. The relationship between bicliques in a bipartite graph, cliques in a general graph, and frequent closed itemsets in a transaction database is exemplified. In (a), the bipartite graph G2 has a maximal biclique B = ({u1,u2},{v2,v3}). In (b), G2 has been transformed into G 2 ̂ by adding edges (dashed lines) between every pair of nodes in the same partition. The vertices of B now form a maximal clique in G 2 ̂ . In (c), a transaction database is built from G2 by treating V as the transaction set and U as the item set. B can now be viewed as a frequent closed itemset in this database.

Back to article page