2994 search results - page 231 / 599 » Time sequences |
122
click to vote
CIE
2010
Springer
15 years 8 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
138
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Our current understanding of transcription factor binding sites (TFBSs) in sequenced prokaryotic genomes is very limited due to the lack of an accurate and efficient c...
149
Voted
ALMOB
2006
15 years 4 months ago
2006
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...
143
Voted
TCS
1998
15 years 4 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
130
Voted
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities i...