Skip to main content
. 2021 Dec 15;50(5):e30. doi: 10.1093/nar/gkab1209

Figure 3.

Figure 3.

Algorithm for constrained subsequences. (1) mCGR with the constraining motif (here CC) is initialized. The matrix size is given by the length of the constraint. (2) The mCGR is scaled to double the size and (3) used for tiling. (4) The result is added and can be used for the next iteration until the order of the matrix for the desired code word length is reached.