Supregraphs are a new graph class that correctly and information-optimally represents error-free read sets for genome assembly, constructed by multiplexing de Bruijn graphs.
3.vis unbranching (both indegree and outdegree equal to1if only if it has a maximal label by substring inclusion among all vertex labels
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
q-bio.GN 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Supregraph: Enabling Information-Optimal Assembly Graph Representation of a Read Set
Supregraphs are a new graph class that correctly and information-optimally represents error-free read sets for genome assembly, constructed by multiplexing de Bruijn graphs.