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. Lu et al. BMC Res Notes 13, 88 (2020) <doi:10.1186/s13104-020-04955-0>.
Version: | 1.0.5 |
Depends: | R (≥ 3.4.0) |
Imports: | graphics, utils |
Published: | 2020-03-03 |
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 gmail.com> |
BugReports: | https://github.com/YupingLu/biclique/issues |
License: | GPL-2 | file LICENSE |
URL: | https://github.com/YupingLu/biclique |
NeedsCompilation: | yes |
Materials: | README NEWS |
CRAN checks: | biclique results |
Reference manual: | biclique.pdf |
Package source: | biclique_1.0.5.tar.gz |
Windows binaries: | r-devel: biclique_1.0.5.zip, r-release: biclique_1.0.5.zip, r-oldrel: biclique_1.0.5.zip |
macOS binaries: | r-release: biclique_1.0.5.tgz, r-oldrel: biclique_1.0.5.tgz |
Old sources: | biclique archive |
Please use the canonical form https://CRAN.R-project.org/package=biclique to link to this page.