Background: The sequencing of the human genome has enabled us to access a comprehensive list of genes (both experimental and predicted) for further analysis. While a majority of t...
Qicheng Ma, Gung-Wei Chirn, Richard Cai, Joseph D....
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
The main motivation for using a multi–objective evolutionary algorithm for finding biclusters in gene expression data is motivated by the fact that when looking for biclusters ...
Association analysis arises in many important applications such as bioinformatics and business intelligence. Given a large collection of measurements over a set of samples, associ...
Feng Pan, Lynda Yang, Leonard McMillan, Fernando P...
Background: The definition of a distance measure plays a key role in the evaluation of different clustering solutions of gene expression profiles. In this empirical study we compa...