Finding Additive Biclusters with Random Background

DOI10.1007/978-3-540-69068-9_25MaRDI QIDQ3506959zbMATH OpenOpenAlexFDO

Authors Jing Xiao, Lusheng Wang, Xiaowen Liu, Tao Jiang

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69068-9_25

zbMATH Keywords

biclusterChernoff boundcomputational biologygene expression data analysispolynomial-time algorithmprobability model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Finding biclusters by random projections
• Combinatorial Pattern Matching
• Approximation Algorithms for Biclustering Problems
• Random walk biclustering for microarray data
• Analysis of biclusters with applications to gene expression data

Cited in

(12)

• Regarding the complexity of additive clustering models: comment on Lee (2001).
• A simple method for generating additive clustering models with limited complexity
• Heuristic search of exact biclusters in binary data
• Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices
• Approximation Algorithms for Biclustering Problems
• Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting
• Improved biclustering on expression data through overlapping control
• Combinatorial Pattern Matching
• Analysis of biclusters with applications to gene expression data
• Finding checkerboard patterns via fractional 0-1 programming
• Finding biclusters by random projections
• An approximation ratio for biclustering

This page was built for publication: Finding Additive Biclusters with Random Background

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