886 search results - page 42 / 178 » On the Autoreducibility of Random Sequences |
DMTCS
2007
13 years 7 months ago
2007
A binary sequence of zeros and ones is called a (d, k)-sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, b...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Many real-world classification tasks involve the prediction of multiple, inter-dependent class labels. A prototypical case of this sort deals with prediction of a sequence of labe...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
It is well known that the base composition along eukaryotic genomes is long-range correlated. Here, we investigate the effect of such long-range correlations on alignment score sta...
GCB
1997
Springer
13 years 12 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
CPAIOR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...