Summary: We introduce reversible structures, an algebra for massive concurrent systems, where terms retain bits of causal dependencies that allow one to reverse computation histories. We then study the implementation of (weak coherent) reversible structures in three-domains DNA strands, which is the natural model that has inspired reversible structures. We finally provide schemes for modeling significant synchronization patterns of process algebra into reversible structures and discuss the encoding of asynchronous reversible CCS.