 |
|
| |
Robust biclustering algorithm (ROBA) for DNA microarray data analysis
Tchagang, A.B.
Twefik, A.H.
Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN;
This paper appears in: Statistical Signal Processing, 2005 IEEE/SP 13th Workshop on
Publication Date: 17-20 July 2005
On page(s): 984-989
ISBN: 0-7803-9403-8
INSPEC Accession Number: 9122934
Digital Object Identifier: 10.1109/SSP.2005.1628738
Current Version Published: 2006-05-08
|
|
|
|
Recently, biclustering algorithms have been used to extract useful information from large sets of DNA microarray experimental data. They refer to a distinct class of clustering algorithms that perform simultaneous row-column clustering. The goal is to find submatrices, that is, subgroups of genes and subgroups of conditions, where the genes exhibit highly correlated activities for every condition. Almost all of the methods proposed in the literature search for one or two types of bicluster among four. Also, most of the proposed methods rely on solving an optimization problem. Therefore, the method is dependant on the optimally criterion which most of the time, is likely to miss some significant biclusters. In this study, we develop a robust biclustering algorithm (ROBA) to address some of the issues mentioned above. Our algorithm is simple because it uses basic linear algebra and arithmetic tools and there is no need to solve and optimization problem. Our algorithm is robust because it can be used to search for any type of bicluster defined by the user in a timely manner and, it is also shown to be more efficient than the ones proposed in the literature
|
|
|
|
|
Controlled Indexing
DNA
biological techniques
data analysis
genetic engineering
matrix algebra
Non-controlled Indexing
DNA microarray data analysis
arithmetic tools
linear algebra
optimization problem
robust biclustering algorithm
submatrices
|
Not Available
|
|
Not Available
|
|
Not Available
|
|
Not Available
|
|
|
|
|
|
| No references available on IEEE Xplore. |
|
|
|
|
|
|
|
| No citing documents available on IEEE Xplore. |
|
|
|
|
|
Cart
