Making de Bruijn graphs Eulerian

DOI10.4230/LIPICS.CPM.2022.12MaRDI QIDQ6496838zbMATH OpenFDO

Authors Giulia Bernardini, Huiping Chen, Grigorios Loukides, Solon P. Pissis, L. Stougie, Michelle Sweering

Publication date 6 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2022.12

zbMATH Keywords

de Bruijn graphEulerian graphgraph algorithmsstring algorithms

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(3)

• Connecting de Bruijn graphs
• On strings having the same length-k substrings
• Shortest undirected paths in de Bruijn graphs

This page was built for publication: Making de Bruijn graphs Eulerian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496838)