An expectation maximization algorithm for training hidden substitution models.
We derive an expectation maximization algorithm for maximum-likelihood training of substitution rate matrices from multiple sequence alignments. The algorithm can be used to train hidden substitution models, where the structural context of a residue is treated as a hidden variable that can evolve over time. We used the algorithm to train hidden substitution matrices on protein alignments in the Pfam database. Measuring the accuracy of multiple alignment algorithms with reference to BAliBASE (a database of structural reference alignments) our substitution matrices consistently outperform the PAM series, with the improvement steadily increasing as up to four hidden site classes are added. We discuss several applications of this algorithm in bioinformatics.
Holmes
I
I
Howard Hughes Medical Institute, University of California, Berkeley, CA 94720, USA. ihh@fruitfly.org
Rubin
G M
GM
D000465:Algorithms; D019943:Amino Acid Substitution; D001483:Base Sequence; D001499:Bayes Theorem; D019295:Computational Biology / Q000379:methods*; D030541:Databases, Genetic; D020407:Internet; D016013:Likelihood Functions; D008390:Markov Chains; D008968:Molecular Conformation; D011506:Proteins / Q000737:chemistry*; D016415:Sequence Alignment / Q000379:methods; D013329:Structure-Activity Relationship
D011506:Proteins