Sciweavers

1129 search results - page 146 / 226
» Finding Similar Failures Using Callstack Similarity
Sort
View
BMCBI
2008
95views more  BMCBI 2008»
13 years 8 months ago
Gene set analyses for interpreting microarray experiments on prokaryotic organisms
Background: Despite the widespread usage of DNA microarrays, questions remain about how best to interpret the wealth of gene-by-gene transcriptional levels that they measure. Rece...
Nathan L. Tintle, Aaron A. Best, Matthew DeJongh, ...
MM
2006
ACM
167views Multimedia» more  MM 2006»
14 years 2 months ago
Image annotation by large-scale content-based image retrieval
Image annotation has been an active research topic in recent years due to its potentially large impact on both image understanding and Web image search. In this paper, we target a...
Xirong Li, Le Chen, Lei Zhang, Fuzong Lin, Wei-Yin...
BMCBI
2005
84views more  BMCBI 2005»
13 years 8 months ago
Information theory-based algorithm for in silico prediction of PCR products with whole genomic sequences as templates
Background: A new algorithm for assessing similarity between primer and template has been developed based on the hypothesis that annealing of primer to template is an information ...
Youfang Cao, Lianjie Wang, Kexue Xu, Chunhai Kou, ...
RECOMB
2004
Springer
14 years 8 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
13 years 8 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama