Maximal Biclique Enumeration in Bipartite Graphs

c(
person("Yuping", "Lu", , "yupinglu89@gmail.com", role = c("aut", "cre", "cph")),
person("Charles", "Phillips", role = "aut"),
person("Michael", "Langston", role = "aut"),
person("Department of Computer Science, University of Tennessee, Knoxville", role = "cph")
)
Yuping Lu [aut, cre, cph],
Charles Phillips [aut],
Michael Langston [aut],
Department of Computer Science, University of Tennessee, Knoxville
[cph]

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>.

Sebastian Kaiser, Rodrigo Santamaria, Roberto Theron, Luis Quintales and Friedrich Leisch.
The main function biclust provides several algorithms to find biclusters in two-dimensional data: Cheng and Church, Spectral, Plaid Model, Xmotifs and Bimax. In addition, the package provides methods for data preprocessing (normalization and discretisation), visualisation, and validation of bicluster solutions.

Sebastian Kaiser, Rodrigo Santamaria, Roberto Theron, Luis
Quintales and Friedrich Leisch.
The main function biclust provides several algorithms to
find biclusters in two-dimensional data: Cheng and Church,
Spectral, Plaid Model, Xmotifs and Bimax. In addition, the
package provides methods for data preprocessing (normalization
and discretisation), visualisation, and validation of bicluster
solutions.

Sebastian Kaiser, Rodrigo Santamaria, Martin Sill, Roberto
Theron, Luis Quintales and Friedrich Leisch.

Sebastian Kaiser, Rodrigo Santamaria, Tatsiana, Khamiakova,
Martin Sill, Roberto Theron, Luis Quintales and Friedrich
Leisch.

R (>= 2.10), MASS, grid, colorspace, lattice

Sebastian Kaiser, Rodrigo Santamaria, Tatsiana Khamiakova,
Martin Sill, Roberto Theron, Luis Quintales, Friedrich
Leisch and Ewoud De Troyer.

methods, flexclust, additivityTests, tidyr, ggplot2
The main function biclust() provides several algorithms to
find biclusters in two-dimensional data: Cheng and Church (2000, ISBN:1-57735-115-0),
spectral (2003) <doi:10.1101/gr.648603>, plaid model (2005) <doi:10.1016/j.csda.2004.02.003>, xmotifs (2003) <doi:10.1142/9789812776303_0008> and bimax (2006) <doi:10.1093/bioinformatics/btl060>. In addition, the
package provides methods for data preprocessing (normalization
and discretisation), visualisation, and validation of bicluster
solutions.