Finding biclusters by random projections
From MaRDI portal
Publication:859851
DOI10.1016/J.TCS.2006.09.023zbMATH Open1171.68865OpenAlexW2158309583MaRDI QIDQ859851FDOQ859851
Authors: Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang 
Publication date: 22 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.023
Recommendations
Pattern recognition, speech recognition (68T10) Randomized algorithms (68W20) Analysis of algorithms (68W40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Special issue: Average-case analysis of algorithms
- On bipartite and multipartite clique problems
- The maximum edge biclique problem is NP-complete
- Approximating Clique and Biclique Problems
- Bipartite sandwiches: Semidefinite relaxations for maximum biclique
- On finding large conjunctive clusters.
- Extracting conserved gene expression motifs from gene expression data
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)
