Sciweavers

STRINGOLOGY
2008
14 years 9 days ago
Fast Optimal Algorithms for Computing All the Repeats in a String
Simon J. Puglisi, William F. Smyth, Munina Yusufu
STRINGOLOGY
2008
14 years 9 days ago
Infinite Smooth Lyndon Words
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...
Geneviève Paquin
STRINGOLOGY
2008
14 years 9 days ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
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...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
STRINGOLOGY
2008
14 years 9 days ago
Efficient Variants of the Backward-Oracle-Matching Algorithm
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...
Simone Faro, Thierry Lecroq