The EM algorithm is considered for the problem of separation of distribution mixtures described by Markov chains, together with the related weighted likelihood maximization problem. Auxiliary algorithms are proposed to select the initial approximation and optimal number of mixture components, as well as a method to approximate the distribution mixture with given data using support vector machines. The results are applied to gene fragment classification.