Sciweavers

2229 search results - page 4 / 446
» Comparative analysis of biclustering algorithms
Sort
View
SIAMCOMP
2008
123views more  SIAMCOMP 2008»
13 years 5 months ago
Approximation Algorithms for Biclustering Problems
One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) tha...
Lusheng Wang, Yu Lin, Xiaowen Liu
DAWAK
2005
Springer
13 years 11 months ago
Gene Expression Biclustering Using Random Walk Strategies
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
Fabrizio Angiulli, Clara Pizzuti
ISCI
2008
102views more  ISCI 2008»
13 years 5 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
COCOA
2009
Springer
13 years 10 months ago
Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting
Discovering groups of genes that share common expression profiles is an important problem in DNA microarray analysis. Unfortunately, standard bi-clustering algorithms often fail t...
Yi Shi, Zhipeng Cai, Guohui Lin, Dale Schuurmans
CBMS
2005
IEEE
13 years 7 months ago
Biclustering of Expression Data Using Simulated Annealing
In gene expression data a bicluster is a subset of genes and a subset of conditions which show correlating levels of expression. However, the problem of finding significant biclu...
Kenneth Bryan, Padraig Cunningham, Nadia Bolshakov...