skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Biclique: an R package for maximal biclique enumeration in bipartite graphs

Journal Article · · BMC Research Notes
ORCiD logo [1];  [2];  [2]
  1. Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
  2. Univ. of Tennessee, Knoxville, TN (United States)

Bipartite graphs are widely used to model relationships between pairs of heterogeneous data types. Maximal bicliques are foundational structures in such graphs, and their enumeration is an important task in systems biology, epidemiology and many other problem domains. Thus, there is a need for an efficient, general purpose, publicly available tool to enumerate maximal bicliques in bipartite graphs. The statistical programming language R is a logical choice for such a tool, but until now no R package has existed for this purpose. Our objective is to provide such a package, so that the research community can more easily perform this computationally demanding task. Biclique is an R package that takes as input a bipartite graph and produces a listing of all maximal bicliques in this graph. Input and output formats are straightforward, with examples provided both in this paper and in the package documentation. Biclique employs a state-of-the-art algorithm previously developed for basic research in functional genomics.

Research Organization:
Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
Sponsoring Organization:
USDOE Office of Science (SC); National Institutes of Health (NIH); USEPA
Grant/Contract Number:
AC02-05CH11231; R01AA018776; G17D112354237
OSTI ID:
1766481
Journal Information:
BMC Research Notes, Vol. 13, Issue 1; ISSN 1756-0500
Publisher:
BioMed CentralCopyright Statement
Country of Publication:
United States
Language:
English

References (10)

A supervised approach for identifying discriminating genotype patterns and its application to breast cancer data journal January 2007
Bicliques in Graphs I: Bounds on Their Number journal January 2000
KONECT: the Koblenz network collection conference January 2013
Obtaining Maximal Concatenated Phylogenetic Data Sets from Large Sequence Databases journal April 2003
Ontological discovery environment: A system for integrating gene–phenotype associations journal December 2009
On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types journal January 2014
Clustering by pattern similarity in large data sets conference January 2002
A graph-theoretical approach for pattern discovery in epidemiological research journal January 2007
The maximum edge biclique problem is NP-complete journal September 2003
Discovering statistically significant biclusters in gene expression data journal July 2002