Protein family classification using sparse markov transducers.
We present a method for classifying proteins into families based on short subsequences of amino acids using a new probabilistic model called sparse Markov transducers (SMT). We classify a protein by estimating probability distributions over subsequences of amino acids from the protein. Sparse Markov transducers, similar to probabilistic suffix trees, estimate a probability distribution conditioned on an input sequence. SMTs generalize probabilistic suffix trees by allowing for wild-cards in the conditioning sequences. Since substitutions of amino acids are common in protein families, incorporating wild-cards into the model significantly improves classification performance. We present two models for building protein family classifiers using SMTs. As protein databases become larger, data driven learning algorithms for probabilistic models such as SMTs will require vast amounts of memory. We therefore describe and use efficient data structures to improve the memory usage of SMTs. We evaluate SMTs by building protein family classifiers using the Pfam and SCOP databases and compare our results to previously published results and state-of-the-art protein homology detection methods. SMTs outperform previous probabilistic suffix tree methods and under certain conditions perform comparably to state-of-the-art protein homology methods.
Eskin
Eleazar
E
Department of Computer Science, Columbia University, New York, NY 10027, USA. noble@gs.washington.edu
Noble
William Stafford
WS
Singer
Yoram
Y
D000465:Algorithms; D000818:Animals; D016208:Databases, Factual; D006801:Humans; D008390:Markov Chains; D011506:Proteins / Q000145:classification* / Q000235:genetics*; D020539:Sequence Analysis, Protein / Q000379:methods*
D011506:Proteins