71
Voted
STRINGOLOGY
2008
15 years 2 months ago
2008
67
Voted
STRINGOLOGY
2008
15 years 2 months ago
2008
109
Voted
STRINGOLOGY
2008
15 years 2 months ago
2008
In a recent paper, Brlek et al showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: what are the infinite smooth w...
105
click to vote
STRINGOLOGY
2008
15 years 2 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
85
Voted
STRINGOLOGY
2008
15 years 2 months ago
2008
In this article we present two efficient variants of the BOM string matching algorithm which are more efficient and flexible than the original algorithm. We also present bit-parall...