Sciweavers

2229 search results - page 306 / 446
» Comparative analysis of biclustering algorithms
Sort
View
SPAA
2005
ACM
14 years 3 months ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...
BMCBI
2005
198views more  BMCBI 2005»
13 years 10 months ago
Clustering protein sequences with a novel metric transformed from sequence similarity scores and sequence alignments with neural
Background: The sequencing of the human genome has enabled us to access a comprehensive list of genes (both experimental and predicted) for further analysis. While a majority of t...
Qicheng Ma, Gung-Wei Chirn, Richard Cai, Joseph D....
BMCBI
2010
101views more  BMCBI 2010»
13 years 10 months ago
Enrichment of homologs in insignificant BLAST hits by co-complex network alignment
Background: Homology is a crucial concept in comparative genomics. The algorithm probably most widely used for homology detection in comparative genomics, is BLAST. Usually a stri...
Like Fokkens, Sandra M. C. Botelho, Jos Boekhorst,...
BMCBI
2010
97views more  BMCBI 2010»
13 years 7 months ago
Preprocessing of gene expression data by optimally robust estimators
Background: The preprocessing of gene expression data obtained from several platforms routinely includes the aggregation of multiple raw signal intensities to one expression value...
Matthias Kohl, Hans-Peter Deigner
GIS
2005
ACM
14 years 11 months ago
Adaptive nearest neighbor queries in travel time networks
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...
Wei-Shinn Ku, Roger Zimmermann, Haojun Wang, Chi-N...