Sciweavers

197 search results - page 21 / 40
» Improved Approximation Algorithms for Bipartite Correlation ...
Sort
View
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
14 years 23 days ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu
BMCBI
2006
120views more  BMCBI 2006»
13 years 7 months ago
An improved distance measure between the expression profiles linking co-expression and co-regulation in mouse
Background: Many statistical algorithms combine microarray expression data and genome sequence data to identify transcription factor binding motifs in the low eukaryotic genomes. ...
Ryung S. Kim, Hongkai Ji, Wing Hung Wong
COCOA
2008
Springer
13 years 9 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
BMCBI
2008
117views more  BMCBI 2008»
13 years 7 months ago
New resampling method for evaluating stability of clusters
Background: Hierarchical clustering is a widely applied tool in the analysis of microarray gene expression data. The assessment of cluster stability is a major challenge in cluste...
Irina Gana Dresen, Tanja Boes, Johannes Hüsin...
POPL
2007
ACM
14 years 7 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...