Representing DNA sequences as a Markov chain

One important step towards gene finding algorithms is to represent a DNA sequence as a Markov chain Figure 1. In this representation a DNA sequence of a reduced alphabet \(\scrA = {A, C, G, T}\) is draw as a four-vertex graph, where each letter of the \(\scrA\) is a state and the edges of the graph represent transitions from one nucleotide to another in a sequence. This is also consdired more specifically as a Discrete Markov chain @axelson-fisk_comparative_2015.

Figure 1: DNA sequence as a Markov chain

Now, several packages (e.g. MarkovChainsHammer, Markovians, etc.) in the Julia ecosystem have been