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

DOI10.1007/S00453-007-0040-4MaRDI QIDQ2384782zbMATH OpenOpenAlexFDO

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

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Genetics and epigenetics (92D10)

Recommendations

• Computing and Combinatorics
• Clustering microarray data: theoretical and practical issues
• Clustering methods in microarrays
• Clustering of microarray data via clique partitioning
• A Generalized Clustering Problem, with Application to DNA Microarrays
• A tutorial on computational cluster analysis with applications to pattern discovery in microarray data
• A spectral clustering method for microarray data
• Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis

Cited in

(12)

• Recovering all generalized order-preserving submatrices: new exact formulations and algorithms
• On the complexity of finding emerging patterns
• Clustering methods in microarrays
• Parameterized algorithms for edge biclique and related problems
• Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems
• Approximation Algorithms for Biclustering Problems
• Inapproximability of Maximum Weighted Edge Biclique and Its Applications
• Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
• scientific article; zbMATH DE number 2081029 (Why is no real title available?)
• Parameterized algorithms for maximum edge biclique and related problems
• Computing and Combinatorics
• A tutorial on computational cluster analysis with applications to pattern discovery in microarray data

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

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