Abstract: A computer processor converts a symbolic sequence Ij (j=1˜m) into a parallel sequence A(k), in which the suffix j is aligned in the following positional relationship: j = 1, 2, . . . k ? 1, k j = k + 1, k + 2, . . . k + k ? 1, k + k : : j = (n ? 1)k + 1, (n ? 1)k + 2, . . . (n ? 1)k + k ? 1, (n ? 1)k + k j = nk + 1, nk + 2, . . . nk + k ? 1, nk + k and additional parallel sequences A(k) can be generated by changing k to p, p+r, p+2r, p+3r . . . . Therefore, a set of parallel sequences ?A(k) can be generated. The parallel sequences may then be visually displayed using different colors for the different symbols in order to reveal at least one latent characteristic existing in the symbolic sequence Ij.
Abstract: A method for expressing at least one characteristic existing in a symbolic sequence that begins with a known single symbolic sequence that is broken down into smaller non-overlapping portions and then placed in parallel to reveal previously unrecognized characteristics in the entire symbolic sequence.