On the readability of overlap digraphs
From MaRDI portal
Recommendations
Cites work
- \boldmath A 2\frac12-Approximation Algorithm for Shortest Superstring
- A greedy approximation algorithm for constructing shortest common superstrings
- An algorithm that builds a set of strings given its overlap graph
- Characterizations for some types of DNA graphs
- DNA sequencing, Eulerian graphs, and the exact perfect matching problem
- Embedding on alphabet overlap digraphs
- Graph theory
- On some properties of DNA graphs
- On the recognition of de Bruijn graphs and their induced subgraphs
- Recognition of overlap graphs
- Recognizing DNA graphs is difficult.
Cited in
(6)
This page was built for publication: On the readability of overlap digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266924)