15792 search results - page 2958 / 3159 » Computational Abstraction Steps |
108
Voted
RECOMB
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
161
click to vote
RECOMB
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...
173
Voted
RECOMB
2001
Springer
16 years 1 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
102
Voted
STOC
2005
ACM
16 years 1 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
216
click to vote
VLDB
2006
ACM
16 years 1 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...