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

Strategy D is mainly for debugging. It is the direct application of the canonicalization rules known from pknotsRG, thus it has a very slow runtime of O(n6). Compared to strategies A to C and regarding the canonization concept, Strategy D is the only non-heuristically one. Thus, it returns the best results, but its runtime is often unaffordable.