When is string reconstruction using de Bruijn graphs hard?
From MaRDI portal
Cites work
- An algorithm for the hierarchical Chinese postman problem
- An Eulerian path approach to DNA fragment assembly
- Approximately counting approximately-shortest paths in directed acyclic graphs
- Edge exploration of temporal graphs
- Eulerian walks in temporal graphs
- Faster exploration of degree-bounded temporal graphs
- Genome assembly, from practice to theory: safe, complete and \textit{linear-time}
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- Non-strict Temporal Exploration
- On temporal graph exploration
- On the Complexity of Universality for Partially Ordered NFAs
- On the hierarchical Chinese postman problem with linear ordered classes
- Optimal Omnitig Listing for Safe and Complete Contig Assembly
- Parameterized algorithms
- Postman tour on a graph with precedence relation on arcs
- Reducibility among combinatorial problems
- Reverse-safe data structures for text indexing
- Reverse-safe text indexing
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
- The temporal explorer who returns to the base
- Time-constrained Chinese postman problems
- Traveling salesman problems in temporal graphs
This page was built for publication: When is string reconstruction using de Bruijn graphs hard?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322451)
