Sciweavers

645 search results - page 114 / 129
» A Parallel Algorithm for Gene Expressing Data Biclustering
Sort
View
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 3 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...
BMCBI
2007
147views more  BMCBI 2007»
15 years 15 days ago
Predicting combinatorial binding of transcription factors to regulatory elements in the human genome by association rule mining
Background: Cis-acting transcriptional regulatory elements in mammalian genomes typically contain specific combinations of binding sites for various transcription factors. Althoug...
Xochitl C. Morgan, Shulin Ni, Daniel P. Miranker, ...
JMLR
2006
96views more  JMLR 2006»
15 years 10 days ago
Rearrangement Clustering: Pitfalls, Remedies, and Applications
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
Sharlee Climer, Weixiong Zhang
BMCBI
2007
174views more  BMCBI 2007»
15 years 12 days ago
ESTuber db: an online database for Tuber borchii EST sequences
Background: The ESTuber database (http://www.itb.cnr.it/estuber) includes 3,271 Tuber borchii expressed sequence tags (EST). The dataset consists of 2,389 sequences from an in-hou...
Barbara Lazzari, Andrea Caprera, Cristian Cosentin...
FMSD
2002
114views more  FMSD 2002»
15 years 5 days ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
Ruben Gamboa