@InProceedings{bernardini_et_al:LIPIcs.CPM.2022.16,
author = {Bernardini, Giulia and Conte, Alessio and Gabory, Esteban and Grossi, Roberto and Loukides, Grigorios and Pissis, Solon P. and Punzi, Giulia and Sweering, Michelle},
title = {{On Strings Having the Same Length- k Substrings}},
booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)},
pages = {16:1--16:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-234-1},
ISSN = {1868-8969},
year = {2022},
volume = {223},
editor = {Bannai, Hideo and Holub, Jan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.16},
URN = {urn:nbn:de:0030-drops-161439},
doi = {10.4230/LIPIcs.CPM.2022.16},
annote = {Keywords: string algorithms, combinatorics on words, de Bruijn graph, Chinese Postman}
}