biclique: Maximal Biclique Enumeration in Bipartite Graphs

A tool for enumerating maximal complete bipartite graphs. The input should be a edge list file or a binary matrix file. The output are maximal complete bipartite graphs. Algorithms used can be found in this paper Y Zhang et al. BMC Bioinformatics 2014 15:110 <doi:10.1186/1471-2105-15-110>.

Version: 1.0.2
Depends: R (≥ 3.4.0)
Imports: graphics, utils
Published: 2019-04-07
Author: Yuping Lu [aut, cre, cph], Charles Phillips [aut], Michael Langston [aut], Department of Computer Science, University of Tennessee, Knoxville [cph]
Maintainer: Yuping Lu <yupinglu89 at>
License: GPL-2 | file LICENSE
NeedsCompilation: yes
Materials: README NEWS
CRAN checks: biclique results


Reference manual: biclique.pdf
Package source: biclique_1.0.2.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X binaries: r-release: biclique_1.0.2.tgz, r-oldrel: not available
Old sources: biclique archive


Please use the canonical form to link to this page.