9 search results - page 1 / 2 » A Characterization of Balanced Episturmian Sequences |
87
Voted
COMBINATORICS
2007
15 years 18 days ago
2007
It is well-known that Sturmian sequences are the non ultimately periodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: the...
115
click to vote
CAI
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This survey paper contains a description of some recent results concerning Sturmian and episturmian words, with particular emphasis on central words. We list fourteen cha...
95
Voted
TCS
2008
15 years 16 days ago
2008
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smalle...
122
click to vote
BMCBI
2011
14 years 7 months ago
2011
Background: To characterize the diversity of bacterial populations in metagenomic studies, sequencing reads need to be accurately assigned to taxonomic units in a given reference ...
108
Voted
COGSR
2011
14 years 7 months ago
2011
In bandit problems, a decision-maker must choose between a set of alternatives, each of which has a fixed but unknown rate of reward, to maximize their total number of rewards ov...