Cargando…
Biclustering of gene expression data using reactive greedy randomized adaptive search procedure
BACKGROUND: 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 multiple functions and experimental conditions are diverse....
Autores principales: | Dharan, Smitha, Nair, Achuthsankar S |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2009
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2648745/ https://www.ncbi.nlm.nih.gov/pubmed/19208127 http://dx.doi.org/10.1186/1471-2105-10-S1-S27 |
Ejemplares similares
-
Optimization by GRASP: greedy randomized adaptive search procedures
por: Resende, Mauricio G C, et al.
Publicado: (2016) -
Biclustering of Gene Expression Data by Correlation-Based Scatter Search
por: Nepomuceno, Juan A, et al.
Publicado: (2011) -
Fuzzy Greedy Randomized Adaptive Search Procedure and Simulation Model to Solve the Team Orienteering Problem with Time Windows
por: Expósito-Márquez, Airam, et al.
Publicado: (2020) -
Bayesian biclustering of gene expression data
por: Gu, Jiajun, et al.
Publicado: (2008) -
Using Greedy Random Adaptive Procedure to Solve the User Selection Problem in Mobile Crowdsourcing
por: Yang, Jian, et al.
Publicado: (2019)