Data to form periodic lossless ternary seeds of maximum weight (Part 2)

<p>Data to form periodic lossless ternary seeds of maximum weight.<br> <br> Detailed information can be found in the GitHub project (https://github.com/vtman/perlotSeeds). Codes&nbsp;to generate periodic blocks (binary and ternary) can also be found there.<br> <br> Binary seeds can have only two symbols (0 = &quot;do not care&quot; = &quot;_&quot; or 1 = &quot;match&quot; = &quot;#&quot;). The length of&nbsp;a seed&nbsp;is the number of its elements, weight of a seed is the number of its 1-elements. The goal is to find seeds of maximum weight, so they can be used when there are two strings with a given number of mismatches. It is observed that in many cases, these seeds of maximum weight have a periodic structure: the same block is repeated multiple times + its remainder. Blocks for binary seeds can be found with the help of the PerFSeeB project (https://github.com/vtman/PerFSeeB). These blocks have the maximum possible weight.&nbsp;<br> <br> In genetics, we have four symbols in sequences (A, C, G, T). However, the chance of having a pointwise mutation is not the same. for any pairs. A&nbsp;<strong>transition</strong>&nbsp;mutation (A&nbsp;&harr;&nbsp;G&nbsp;or&nbsp;C&nbsp;&harr;&nbsp;T) is often twice higher than a&nbsp;<strong>transversion</strong>&nbsp;mutation (A&nbsp;&harr;&nbsp;C,&nbsp;A&nbsp;&harr;&nbsp;T,&nbsp;G&nbsp;&harr;&nbsp;C,&nbsp;G&nbsp;&harr;&nbsp;T). Transition-constrained seeds use ternary alphabet {<strong>#</strong>,&nbsp;<strong>@</strong>,&nbsp;<strong>_</strong>} where&nbsp;<strong>@</strong>&nbsp;is for a match or a transition mismatch. To generate ternary seeds, we first need to generate ternary blocks. These ternary blocks can be found when we use binary blocks. However, we sometimes&nbsp;need to use binary blocks for less than the maximum weight.<br> <br> T4V2.zip and T7V2.zip are in this dataset.</p>