Sciweavers

9 search results - page 2 / 2
» Merit Factors and Morse Sequences
Sort
View
DLT
2008
13 years 6 months ago
Relationally Periodic Sequences and Subword Complexity
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni
AAECC
2001
Springer
95views Algorithms» more  AAECC 2001»
13 years 9 months ago
Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation
Abstract. Cyclotomic constructions are given for several infinite families of even length binary sequences which have low negaperiodic autocorrelation. It appears that two of the ...
Matthew G. Parker
DAM
1999
114views more  DAM 1999»
13 years 5 months ago
Perfect and Almost Perfect Sequences
The autocorrelation function of a sequence is a measure for how much the given sequence di ers from its translates. Periodic binary sequences with good correlation properties have...
Dieter Jungnickel, Alexander Pott
BMCBI
2005
145views more  BMCBI 2005»
13 years 5 months ago
CAGER: classification analysis of gene expression regulation using multiple information sources
Background: Many classification approaches have been applied to analyzing transcriptional regulation of gene expressions. These methods build models that can explain a gene's...
Jianhua Ruan, Weixiong Zhang