Biclustering of gene expression data using reactive greedy randomized adaptive search procedure

被引：0
作者：
Smitha Dharan
Achuthsankar S Nair
机构：
[1] University of Kerala,Centre for Bioinformatics
[2] College of Engineering,Department of Computer Engineering
来源：
BMC Bioinformatics | / 10卷
关键词：
Greedy Randomize Adaptive Search Procedure; Construction Phase; Local Search Phase; Restricted Candidate List; Gene Expression Matrix;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 22 条
[1]  
Madeira SC(2004)Biclustering algorithms for biological data analysis: a survey IEEE Trans Computational Biology and Bioinformatics 1 24-48
[2]  
Oliveira AL(2000)Biclustering of gene expression data Proceedings of the International Conference on Intelligent Systems for Molecular Biology 8 93-103
[3]  
Cheng Y(2005)Shifting and scaling patterns from gene expression data Bioinformatics 21 3840-3845
[4]  
Church GM(1995)Greedy randomized adaptive search procedures Global optimization 6 109-133
[5]  
Aguilar-Ruiz Jesus S(2003)Metaheuristics in combinatorial optimization: overview and conceptual comparison ACM Computing Surveys 35 268-308
[6]  
Feo TA(2000)Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment INFORMS Journal on Computing 12 164-176
[7]  
Resende MGC(2006)Evolutionary biclustering of gene expressions ACM Ubiquity 7 1-12
[8]  
Blum C(2005)Discovering coherent biclusters from gene expression data using zero-suppressed binary decision diagrams IEEE/ACM Transactions on Computational Biology and Bioinformatics 2 339-354
[9]  
Roli A(1999)Systematic determination of genetic network architecture Nat Genet 22 281-285
[10]  
Prais M(undefined)undefined undefined undefined undefined-undefined
123