Linear-Time Computation of Shortest Covers of All Rotations of a String

Crochemore, Maxime; Iliopoulos, Costas; Radoszewski, Jakub; Rytter, Wojciech; Straszyński, Juliusz; Walen, Tomasz; Zuba, Wiktor

by Maxime Crochemore, Costas Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Walen, Wiktor Zuba

Reference:

Linear-Time Computation of Shortest Covers of All Rotations of a String (Maxime Crochemore, Costas Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Walen, Wiktor Zuba), In 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic (Jan Holub, Hideo Bannai, eds.), 2022.

Bibtex Entry:

@inproceedings{cpm2022,
author    = {Maxime Crochemore and Costas Iliopoulos and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszyński and Tomasz Walen and Wiktor Zuba},
editor    = {Jan Holub and Hideo Bannai},
title     = {Linear-Time Computation of Shortest Covers of All Rotations of a String},
booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2022,
June 27-29, 2022, Prague, Czech Republic},
year      = {2022}
}