Sciweavers

14169 search results - page 2611 / 2834
» Tabular application development
Sort
View
200
Voted
RECOMB
2005
Springer
16 years 7 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
RECOMB
2002
Springer
16 years 7 months ago
DNA sequence evolution with neighbor-dependent mutation
We introduce a model of DNA sequence evolution which can account for biases in mutation rates that depend on the identity of the neighboring bases. An analytic solution for this c...
Peter F. Arndt, Christopher B. Burge, Terence Hwa
261
Voted
RECOMB
2002
Springer
16 years 7 months ago
Discovering local structure in gene expression data: the order-preserving submatrix problem
This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing me...
Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Y...
186
Voted
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
16 years 7 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 7 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
« Prev « First page 2611 / 2834 Last » Next »