Finding biclusters by random projections
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1750182 (Why is no real title available?)
- Approximating Clique and Biclique Problems
- Bipartite sandwiches: Semidefinite relaxations for maximum biclique
- Extracting conserved gene expression motifs from gene expression data
- On bipartite and multipartite clique problems
- On finding large conjunctive clusters.
- Special issue: Average-case analysis of algorithms
- The maximum edge biclique problem is NP-complete
Cited in
(8)- Analysis of biclusters with applications to gene expression data
- Topological biclustering ARTMAP for identifying within bicluster relationships
- On finding large conjunctive clusters.
- Near optimal solutions for maximum quasi-bicliques
- Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices
- Nondeterministic communication complexity of random Boolean functions (extended abstract)
- Combinatorial Pattern Matching
- Finding Additive Biclusters with Random Background
This page was built for publication: Finding biclusters by random projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859851)