The topological matrix of a de Bruijn diagram defines the connectivity of a diagram by indicating the different branches that arise when symbols are added and deleted from a sequence, but it takes no account of the likelihood that one or the other of the symbols will be chosen. If probabilities are incorporated in the matrix elements, it is just as easy to calculate the probability that a long string will occur as to establish the possibility of its presence in the first place.