Analysis of biclusters with applications to gene expression data

MaRDI QIDQ5485322zbMATH OpenFDO

Authors Gahyun Park, Wojciech Szpankowski

Publication date 29 August 2006

zbMATH Keywords

random matrixmicroarray databicliquetwo-dimensional patternsbicluster

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Recommendations

• Finding biclusters by random projections
• Combinatorial Pattern Matching
• Approximation Algorithms for Biclustering Problems
• Finding Additive Biclusters with Random Background
• Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices

Cited in

(10)

• State-of-the-art of Cluster Analysis of Gene Expression Data
• Erratum
• Topological biclustering ARTMAP for identifying within bicluster relationships
• The rectangle covering number of random Boolean matrices
• Improved biclustering of microarray data demonstrated through systematic performance tests
• Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices
• Random walk biclustering for microarray data
• Nondeterministic communication complexity of random Boolean functions (extended abstract)
• Combinatorial Pattern Matching
• Finding Additive Biclusters with Random Background

This page was built for publication: Analysis of biclusters with applications to gene expression data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485322)