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

BMC Research Notes

Michael A. Langston¹  Charles A. Phillips¹  Yuping Lu² 

[1] Department of Electrical Engineering and Computer Science, University of Tennessee;Lawrence Berkeley National Laboratory;

关键词: Biclique;    Bipartite graph;    Graph algorithms;    Maximality;    R package;   

DOI  :  10.1186/s13104-020-04955-0

来源: DOAJ

【 摘 要 】

Abstract Objective 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. Results 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. This package, along with its source code and reference manual, are freely available from the CRAN public repository at https://cran.r-project.org/web/packages/biclique/index.html .

【 授权许可】

Unknown