Complexity Study on Two Clustering Problems

Authors:
Louxin Zhang;Song Zhu
Affiliations:
-;-
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2001

Citing 4
Cited 0

Clustering gene expression patterns

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
An algorithm for clustering cDNAs for gene expression analysis

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Biclustering of Expression Data

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity issues of two clustering problems are studied. We prove that the Smooth Clustering and Biclustering problems are NP-hard; we also propose an 0.5 approximation algorithm and 0.8 inapproximability for a simplified clutering problem.