276 search results - page 54 / 56 » The Complexity of Computing Maximal Word Functions |
ASWSD
2004
Springer
14 years 26 days ago
2004
Springer
The paper first presents the integration options of what we call the Timing Description Language (TDL) with MathWorks' Simulink tools. Based on the paradigm of logical executi...
RECOMB
2002
Springer
14 years 7 months ago
2002
Springer
We introduce a model-based analysis technique for extracting and characterizing rhythmic expression pro les from genome-wide DNA microarray hybridization data. These patterns are ...
INTERNET
2002
13 years 7 months ago
2002
stract level, remote procedure calls enable programmers to invoke (possibly remote) services as if they were intra-application procedure calls. Much like function or procedure call...
ACST
2006
13 years 8 months ago
2006
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computer science. The main goal of pattern discovery in DNA sequences is to identi...
COCO
2003
Springer
14 years 20 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...