Name
Abstract | ||
|---|---|---|
Production of gene expression chip involves a large number of error-prone steps that lead to a high level of noise in the corresponding data. Given the variety of available biclustering algorithms, one of the problems faced by biologists is the selection of the algorithm most appropriate for a given gene expression data set. This paper compares two techniques for biclustering of gene expression data i.e. a recent technique based on crossing minimization paradigm and the other being Order Preserving Sub Matrix (OPSM) technique. The main parameter for evaluation being the quality of the results in the presence of noise in gene expression data. The evaluation is based on using simulated data as well as real data. Several limitations of OPSM were exposed during the analysis, the key being its susceptibility to noise. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11550822_95 | ICANN (1) |
Keywords | Field | DocType |
biclustering gene expression data,error-prone step,gene expression data,corresponding data,simulated data,recent technique,available biclustering algorithm,gene expression chip,high level,order preserving sub matrix,gene expression,chip | Pattern recognition,Matrix (mathematics),Computer science,Algorithm,Gene expression,Chip,Minification,Artificial intelligence,Biclustering,Noise immunity,DNA microarray | Conference |
Volume | ISSN | ISBN |
3696 | 0302-9743 | 3-540-28752-3 |
Citations | PageRank | References |
1 | 0.42 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahsan Abdullah | 1 | 45 | 7.98 |
| Amir Hussain | 2 | 672 | 67.84 |