  We present a row reduction algorithm to compute the barcode decomposition of
persistence modules. This algorithm dualises the standard persistence one and
clarifies the symmetry between clear and compress optimisations.
