1. 7
    1. 1

      Reorder items not appearing in the LCS, but present in the structures.

      What’s an LCS?

      1. 1

        LCS is an acronym for the longest common subsequence problem. You may know it if you’ve studied how diff works because it’s one, but not only, way to calculate diff between two text files. The point to using it here is to keep the moving of indeterminates few while shuffling them into same order. LCS reveals the longest sequence of indeterminates that are already in the same order.

        I added this into the post as well.