Abstract SIMD||DNA represents a model for DNA strand displacement that facilitates parallel computation within DNA storage. We demonstrate the capability to emulate an arbitrary 3-symbol space-constrained Turing machine using a SIMD||DNA program, providing a more straightforward and effective approach to general information manipulation on DNA storage compared to the Rule 110 simulation by Wang, Chalk, and Soloveichik [12]. Additionally, we have created software [10] that... SIMD||DNA represents a model for DNA strand displacement that facilitates parallel computation within DNA storage. We demonstrate the capability to emulate an arbitrary 3-symbol space-constrained Turing machine using a SIMD||DNA program, providing a more straightforward and effective approach to general information manipulation on DNA storage compared to the Rule 110 simulation by Wang, Chalk, and Soloveichik [12]. Additionally, we have created software [10] that can simulate SIMD||DNA programs and generate SVG illustrations. Read More Read Less

Abstract We present the solver DAGer for the Directed Feedback Vertex Set (DFVS) problem, as it was entered in the exact category of the 2022 PACE Challenge. Our method initially employs a variety of preprocessing strategies that incorporate both established data reduction techniques for DFVS and innovative modifications derived from the vertex cover problem. In terms of the actual solving process, we discovered that... We present the solver DAGer for the Directed Feedback Vertex Set (DFVS) problem, as it was entered in the exact category of the 2022 PACE Challenge. Our method initially employs a variety of preprocessing strategies that incorporate both established data reduction techniques for DFVS and innovative modifications derived from the vertex cover problem. In terms of the actual solving process, we discovered that utilizing a MaxSAT solver with incremental constraints yields impressive results. Read More Read Less