Alexander Yu. Mitrophanov

Learn More
One of the major goals of computational sequence analysis is to find sequence similarities, which could serve as evidence of structural and functional conservation, as well as of evolutionary relations among the sequences. Since the degree of similarity is usually assessed by the sequence alignment score, it is necessary to know if a score is high enough to(More)
For the distribution of a finite, homogeneous, continuous-time Markov chain, we derive perturbation bounds in terms of the ergodicity coefficient of the transition probability matrix. Our perturbation bounds improve upon the known results. We give sensitivity bounds for the coefficient of ergodicity, providing a sufficient condition for the uniqueness of(More)
The TKF91 model of biological sequence evolution describes changes in the sequence length via an infinite state-space birth-death process, which we term the TKF91-BD process. The TKF91 model assumes that, for any pair of modern sequences, the ancestral sequence has equilibrium length distribution, an assumption whose validity has not been rigorously(More)
  • 1