@InProceedings{bernardini_et_al:LIPIcs.CPM.2022.12,
author = {Bernardini, Giulia and Chen, Huiping and Loukides, Grigorios and Pissis, Solon P. and Stougie, Leen and Sweering, Michelle},
title = {{Making de Bruijn Graphs Eulerian}},
booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)},
pages = {12:1--12:18},
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.12},
URN = {urn:nbn:de:0030-drops-161391},
doi = {10.4230/LIPIcs.CPM.2022.12},
annote = {Keywords: string algorithms, graph algorithms, Eulerian graph, de Bruijn graph}
}