This is a part of Grammars/gra_pknot_microstate.gap. It is responsible for Strategy C computation of kissing hairpins for the program pKiss.

Since larger memory is often a harder problem than longer runtime, we alter Strategy B to trade memory for runtime. Strategy C avoids the extra storage required by Strategy B by re-computing the necessary information on demand. Coupling running indices k and l reduces the runtime by one dimension.