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 Motivated by a linear time-complexity result for an adaptive Monte Carlo algorithm, we propose and analyze an adaptive deterministic algorithm ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback