Prediction suffix trees for supervised classification of sequences

Pattern Recognition Letters

Volumn 24, Issue 16, 2003, Pages 3153-3164

  Largeron Leténo, Christine ^a  

^a UNIVERSITÉ JEAN MONNET   (France)

Author keywords

Chronobiological and DNA sequences; Markov model; Patterns extraction; Prediction suffix tree; Supervised classification; Variable order chain

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); MARKOV PROCESSES; STATISTICAL TESTS; TREES (MATHEMATICS);

PREDICTION SUFFIX TREES (PST);

PATTERN RECOGNITION;

ALGORITHM; DATA PROCESSING; IMAGE CLASSIFICATION; PATTERN RECOGNITION;

EID: 0142057150     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2003.08.002     Document Type: Article

References (18)

1. Bejerano G. Yona G. Variations on probabilistic suffix trees: Statistical modelling and prediction of protein families Bioinformatics 17 1 2001 23-41
2. Buhlmann P. Wyner A. Variable order chains Ann. Statist. 27 2 1999 480-513
3. Day W.H. Mcmorris F.R. Alignment, comparison and consensus of molecular sequences Diday E. New Approaches in Classification and Data Analysis 1994 327-346
4. Fisher R.A. Statistical Methods for Research Workers 1925-1970 Oliver and Boyd Edinburgh
5. Greenwood P.E. Nikulin M.S. A Guide to Chi-Squared Testing 1996 John Wiley and sons New York
6. Henikoff J.G. Henikoff S. Using substitution probabilities to improve position-specific scoring matrices Comm. Appl. Biosci. 12 2 1996 135-143
7. Katz S.M. Estimation of probabilities from sparse data for the language model component of a speech recognizer IEEE Trans. Acoust. Speech Signal Process. ASSP 35 3 1987 400-401
8. Kendall, M., Stuart, A., 1987. In: Kendall's Advanced Theory of Statistics, vol. 2. Griffin
9. Kermorvant, C., Dupont, P., 2002a. Improved smoothing for variable order Markov chains. In: Eur. Conf. Machine Learning (ECML), Helsinki, Finland, 2002
10. Kermorvant, C., Dupont, P., 2002b. Chânes de Markov d'ordre variable pour la détection de domaines dans les protéines (JOBIM), Saint-Malo France
11. Kruskal J.B. An overview of sequence comparison Time Warps String Edits and Macromolecules The Theory and Practice of Sequence Comparison 1983 Addison-Wesley Publishing Company Reading, MA
12. Largeron, C., 2001. Algorithme de comparaison d'arbres: Application au classement de séquences. In: SFC'01 7eme conférence de la Société Francophone de Classification Pointe-à-Pitre. Available from (visited 19/05/03)
13. Lehmann L. Testing Statistical Hypotheses 1986 John Wiley Sons New York
14. Mehta C.R. Patel N.R. A network algorithm for performing Fisher's exact test in r×c contingency tables J. Amer. Statist. Associ. 78 382 1983 427-434
15. Rissanen J. A universal data compression system IEEE Trans. Inform. Theory 29 5 1983 656-664
16. Ron D. Singer Y. Tishby N. The power of amnesia: Learning probabilistic automata with variable memory length Mach. Learn. 25 1996 117-149
17. Weinberger M.J. Lempel A. Ziv J. A sequential algorithm for the universal coding of finite memory sources IEEE Trans. Inform. Theory 38 1992 1002-1014
18. Willems F.M.J. Shtarkov Y.M. Tjalkens T.J. The context tree weighting method: Basic properties IEEE Trans. Inform. Theory 41 1995 53-664