Bayesian clustering of DNA sequences using Markov chains and a stochastic partition model.
In many biological applications it is necessary to cluster DNA sequences into groups that represent underlying organismal units, such as named species or genera. In metagenomics this grouping needs typically to be achieved on the basis of relatively short sequences which contain different types of errors, making the use of a statistical modeling approach desirable. Here we introduce a novel method for this purpose by developing a stochastic partition model that clusters Markov chains of a given order. The model is based on a Dirichlet process prior and we use conjugate priors for the Markov chain parameters which enables an analytical expression for comparing the marginal likelihoods of any two partitions. To find a good candidate for the posterior mode in the partition space, we use a hybrid computational approach which combines the EM-algorithm with a greedy search. This is demonstrated to be faster and yield highly accurate results compared to earlier suggested clustering methods for the metagenomics application. Our model is fairly generic and could also be used for clustering of other types of sequence data for which Markov chains provide a reasonable way to compress information, as illustrated by experiments on shotgun sequence type data from an Escherichia coli strain.
Väinö
V
Jääskinen
Ville
V
Parkkinen
Lu
L
Cheng
Jukka
J
Corander
D000465:Algorithms; D001185:Artificial Intelligence; D001483:Base Sequence; D001499:Bayes Theorem; D016000:Cluster Analysis; D003198:Computer Simulation; D003627:Data Interpretation, Statistical; D005798:Genes, Bacterial; D016013:Likelihood Functions; D008390:Markov Chains; D017422:Sequence Analysis, DNA; D013269:Stochastic Processes