Approximation Algorithms for Biclustering Problems

DOI10.1137/060664112MaRDI QIDQ3395042zbMATH OpenOpenAlexFDO

Authors Lusheng Wang, Yu Lin, Xiaowen Liu

Publication date 20 August 2009

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/060664112

zbMATH Keywords

approximation algorithmscomputational biologygenesmicroarray data analysis

Mathematics Subject Classification ID

Approximation algorithms (68W25) Linear programming (90C05) Combinatorial optimization (90C27) General biology and biomathematics (92B05)

Recommendations

• An approximation ratio for biclustering
• Algorithmic and complexity issues of three clustering methods in microarray data analysis
• Finding Additive Biclusters with Random Background
• Computing and Combinatorics
• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters

Cited in

(13)

• Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult
• The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
• Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems
• Integer Programming of Biclustering Based on Graph Models
• Improved Approximation Algorithms for Bipartite Correlation Clustering
• Finding Additive Biclusters with Random Background
• An improved heuristic for consistent biclustering problems
• A branch‐and‐price approach to k‐clustering minimum biclique completion problem
• Combinatorial Pattern Matching
• Analysis of biclusters with applications to gene expression data
• Computing and Combinatorics
• Computing and Combinatorics
• An approximation ratio for biclustering

This page was built for publication: Approximation Algorithms for Biclustering Problems

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