|
|
|
Sukhpal Singh Ghuman, Emanuele Giaquinta and Jorma Tarhio
We present two modifications of Duval?s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it is able to skip ...
ver más
|
|
|