\section{Problem and main results} \label{sec:introduction} Minimum decycling sets (MDS) remove all directed cycles from a de Bruijn graph at minimum cardinality. They support sequence sketching; the ordinary minimum follows from Mykkeltveit's construction and the unavoidable-set formulation of Champarnaud, Hansel and Perrin \cite{Mykkeltveit1972,ChamparnaudHanselPerrin2004}. Recent work studies residual paths, move components and reverse-complement-aware sketches \cite{ZhengKingsfordMarcais2021,PellowEtAl2023,MarcaisDeBlasioKingsford2024,MarcaisElderKingsford2024}. The imported parity construction \cite{Babanskyy2026Parity} admits arbitrary injective, nonzero, antisymmetric real weights. Our complete DNA atlas and its 141 bound concern precisely the fixed labelled family \[ \mathcal W=\{(s(A),s(C),s(G),s(T))=(-\rho,-1,1,\rho):\rho>1\}, \] with the fixed lexicographic tie order $A