Biclustering of gene expression data using reactive greedy randomized adaptive search procedure
<p>Abstract</p> <p>Background</p> <p>Biclustering algorithms belong to a distinct class of clustering algorithms that perform simultaneous clustering of both rows and columns of the gene expression matrix and can be a very useful analysis tool when some genes have multi...
Main Authors: | Dharan Smitha, Nair Achuthsankar S |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2009-01-01
|
Series: | BMC Bioinformatics |
Similar Items
-
Biclustering of the Gene Expression Data by Coevolution Cuckoo Search
by: Lu Yin, et al.
Published: (2015-06-01) -
Greedy randomized adaptive search procedure for traveling salesman problem
by: Lee, Seung Ho
Published: (2006) -
Biclustering of Gene Expression Data by Correlation-Based Scatter Search
by: Nepomuceno Juan A, et al.
Published: (2011-01-01) -
Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem
by: J.D. Quintana, et al.
Published: (2016-12-01) -
Improved Greedy Randomized Adaptive Search Procedure for Dynamic Berth Allocation Problem
by: Lin, Dai-Yang, et al.
Published: (2011)