Zuba, W. and Lachish, Oded and Pissis, S.P. (2024) Shortest Undirected Paths in de Bruijn Graphs. In: https://cpm2025.pangenome.eu/, 17–19 Jun 2025, Milan, Italy. (In Press)
|
Text
Undirected_dBG_shortest_path.pdf - Published Version of Record Available under License Creative Commons Attribution. Download (701kB) | Preview |
Abstract
is not the case for computing undirected paths, which is algorithmically much more challenging. 13 Here we present a general framework for computing shortest undirected paths in arbitrary de Bruijn 14 graphs. We then present an application of our techniques for making any arbitrary order-k de Bruijn 15 graph G(V,E) weakly connected by adding a set of edges of minimal total cost. This improves on 16 the running time of the recent (2 − 2/d)-approximation algorithm by Bernardini et al. [CPM 2024] 17 from O(k|V |2) to O(k|V | log d) time, where d is the number of weakly connected components of G.
Metadata
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Oded Lachish |
| Date Deposited: | 02 Jul 2025 13:07 |
| Last Modified: | 20 Sep 2025 20:52 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/54935 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
