Birkbeck Institutional Research Online
metadata only
Shortest undirected paths in de Bruijn Graphs
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 Brui
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Velvet: Algorithms for de novo short read assembly using de Bruijn graphs#6969
- Matroids and isomorphism problems for Bestvina-Brady groups#1110708
- Implementation of algorithms for sorting by strip swaps using alternating cycle graphs#310057
- An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph#1062749
- Graphes complexes en biologie : problèmes, algorithmes et évaluations#624843
Record · ID 1136734
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive