Sciweavers

927 search results - page 54 / 186
» Algorithms for Finding Gene Clusters
Sort
View
BMCBI
2007
105views more  BMCBI 2007»
15 years 3 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
138
Voted
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
15 years 4 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
152
Voted
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 6 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
106
Voted
CSB
2004
IEEE
164views Bioinformatics» more  CSB 2004»
15 years 7 months ago
Biclustering in Gene Expression Data by Tendency
The advent of DNA microarray technologies has revolutionized the experimental study of gene expression. Clustering is the most popular approach of analyzing gene expression data a...
Jinze Liu, Jiong Yang, Wei Wang 0010
119
Voted
IDA
2007
Springer
15 years 3 months ago
An unsupervised clustering approach for leukaemia classification based on DNA micro-arrays data
: DNA micro-arrays provide thousands of genomic expressions on the same subject. A main issue is then to find the subset of genes whose degeneration is responsible of a certain typ...
Simone Garatti, Sergio Bittanti, Diego Liberati, A...