1607 search results - page 8 / 322 » The existence of k-radius sequences |
IDA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This work aims to improve an existing time series forecasting algorithm –LBF– by the application of frequent episodes techniques as a complementary step to the model....
CPM
2010
Springer
14 years 14 days ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
CC
2005
Springer
13 years 7 months ago
2005
Springer
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...
AAECC
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We consider the problem of determining the period of a binary sequence. For sequences with small autocorrelation we prove the existence of a polynomial time quantum algor...
BMCBI
2010
13 years 7 months ago
2010
Background: High throughput sequencing has become an increasingly important tool for biological research. However, the existing software systems for managing and processing these ...