The evolution of DNA sequences can be described by discrete state continuous time Markov processes on a phylogenetic tree. We consider neighbor-dependent evolutionary models where the instantaneous ...
This is a preview. Log in through your library . Abstract This paper presents a partitioning algorithm for recursively computing the steady state probabilities for a finite, irreducible Markov chain ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback