Improved Smoothing for Probabilistic Suffix Trees Seen as Variable Order Markov Chains
暂无分享,去创建一个
[1] Eleazar Eskin,et al. Protein Family Classification Using Sparse Markov Transducers , 2000, J. Comput. Biol..
[2] Thomas G. Dietterich. Approximate Statistical Tests for Comparing Supervised Classification Learning Algorithms , 1998, Neural Computation.
[3] Rolf Apweiler,et al. The SWISS-PROT protein sequence data bank and its new supplement TREMBL , 1996, Nucleic Acids Res..
[4] Hermann Ney,et al. Improved backing-off for M-gram language modeling , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.
[5] Frederick Jelinek,et al. Interpolated estimation of Markov source parameters from sparse data , 1980 .
[6] Dana Ron,et al. The Power of Amnesia , 1993, NIPS.
[7] Hermann Ney,et al. On structuring probabilistic dependences in stochastic language modelling , 1994, Comput. Speech Lang..
[8] A. Bairoch. PROSITE: a dictionary of sites and patterns in proteins. , 1991, Nucleic acids research.
[9] D. Haussler,et al. Hidden Markov models in computational biology. Applications to protein modeling. , 1993, Journal of molecular biology.
[10] R. Durbin,et al. Pfam: A comprehensive database of protein domain families based on seed alignments , 1997, Proteins.
[11] W. E. Johnson. I.—PROBABILITY: THE DEDUCTIVE AND INDUCTIVE PROBLEMS , 1932 .
[12] Sean R. Eddy,et al. HMMER User's Guide - Biological sequence analysis using profile hidden Markov models , 1998 .
[13] Golan Yona,et al. Variations on probabilistic suffix trees: statistical modeling and prediction of protein families , 2001, Bioinform..
[14] Slava M. Katz,et al. Estimation of probabilities from sparse data for the language model component of a speech recognizer , 1987, IEEE Trans. Acoust. Speech Signal Process..