Algorithmic and complexity issues of three clustering methods in microarray data analysis

DOI10.1007/S00453-007-0040-4zbMath1124.68044OpenAlexW2063155169MaRDI QIDQ2384782

Song Zhu, Louxin Zhang, Jinsong Tan, Kok Seng Chua

Publication date: 10 October 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-0040-4

zbMATH Keywords

NP-hardorder-preserving submatrix problemsmooth clustering problem

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Approximation algorithms (68W25)

Related Items (3)

Parameterized algorithms for edge biclique and related problems ⋮ Inapproximability of Maximum Weighted Edge Biclique and Its Applications ⋮ Parameterized Algorithms for Maximum Edge Biclique and Related Problems

This page was built for publication: Algorithmic and complexity issues of three clustering methods in microarray data analysis