Solution:

First, we prove such a string can be divided into blocks where each block consists of the same substring written three times. We prove the following lemma.

Lemma 1. For any letter $x_{1}$, the strings between the first and second occurrences of $x_{1}$ and between the second and third occurrences of $x_{1}$ are the same.

Proof. Call these two strings $s_{1}$ and $s_{2}$. We know they must be permutations of each other, and if a letter appears twice in $s_{1}$, it would also have to appear twice in $s_{2}$, for four appearances in all, which is impossible. Thus, no letter appears twice in $s_{1}$ (and likewise in $s_{2}$).

Assume for sake of contradiction that for some letters $x_{2}$ and $x_{3}$ in these strings, $x_{2}$ appears before $x_{3}$ in $s_{1}$, but after $x_{3}$ in $s_{2}$. Then, between these two appearances of $x_{2}$ (which are consecutive, because no other $x_{2}$'s appear in either $s_{1}$ or $s_{2}$), there must be two $x_{3}$'s. This implies there must also be two $x_{3}$'s between the other pair of consecutive $x_{2}$'s, contradiction.

We conclude any two letters in $s_{1}$ and $s_{2}$ appear in the same order in both strings, so $s_{1} = s_{2}$. $\square$

Let the first letter of our 78-character string be $x_{1}$, and suppose the next appearance of $x_{1}$ is the $(k + 1)$-th letter. Let $x_{2}$, $x_{3}$, ..., $x_{k}$ be the letters in between. Then, $x_{2}x_{3}\ldots x_{k}$ is the string between the first and second $x_{1}$'s, so it must also be the string between the second and third $x_{1}$'s. Thus, after the second $x_{1}$, we must have $x_{2}x_{3}\ldots x_{k}x_{1}$.

Now, between the first and second $x_{k}$'s is the string $x_{1}x_{2}x_{3}\ldots x_{k-1}$, so this must also be between the second and third $x_{k}$'s. Thus, after the second $x_{k}$, we must have $x_{1}x_{2}x_{3}\ldots x_{k}$.

Thus, the first $3k$ letters are simply $x_{1}x_{2}x_{3}\ldots x_{k}$ repeated three times. We can remove this block of $3k$ letters and repeat to show that the whole string can be divided into such blocks.

To count the number of such strings, we first note that there are $2^{25}$ ways to divide the strings into such blocks. This is because there are 25 possible places which can divide two blocks (after the 3rd, 6th, 9th, etc. letters), and we can choose any subset of these to divide blocks.

The string is then uniquely determined by the first one-third of each block, which must consist of every letter exactly once (as the whole string is just three copies of these thirds spliced together). These thirds can consist of any ordering of the 26 letters, so there are 26! strings with any given partition of blocks.

We conclude the total number of strings is $\boxed{2^{25}\cdot 26!}$.