Testing statistical hypothesis on random trees and applications to the protein classification problem

Annals of Applied Statistics

Volumn 3, Issue 2, 2009, Pages 542-563

  Busch, Jorge R ^a   Ferrari, Pablo A ^b   Flesia, Ana Georgina ^c   Fraiman, Ricardo ^d   Grynberg, Sebastian P ^a   Leonardi, Florencia ^b  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c UNIVERSIDAD NACIONAL DE CÓRDOBA   (Argentina)

^d UNIVERSIDAD DE SAN ANDRÉS   (Argentina)

Author keywords

Hypothesis testing; Protein classification; Random trees; Variable length Markov chains

Indexed keywords

EID: 78751604157     PISSN: 19326157     EISSN: 19417330     Source Type: Journal    
DOI: 10.1214/08-AOAS218     Document Type: Article

References (19)

1. Balding, D., Ferrari, P., Fraiman, R. and Sued, M. (2008). Limit theorems for sequences of random trees. Test (online). DOI: 10.1007/s11749-008-0092-z.
2. Banks, D. and Constantine, G. (1998). Metric models for random graphs. J. Classification 15 199-223.
3. Bejerano, G. (2003). Automata learning and stochastic modeling for biosequence analysis. Ph.D. thesis, Hebrew Univ.
4. Bejerano, G. (2004). Algorithms for variable length Markov chain modeling. Bioinformatics 20 788-789.
5. Bejerano, G. and Yona, G. (2001). Variations on probabilistic suffix trees: Statistical modeling and prediction of protein families. Bioinformatics 1723-43.
6. Bühlmann, P. and Wyner, A. J. (1999). Variable length Markov chains. Ann. Statist. 27 480-513.
7. Csiszár, I. and Talata, Z. (2006). Context tree estimation for not necessarily finite memory processes, via BIC and MDL. IEEE Trans. Inform. Theory 521007-1016.
8. Finn, R. D., Mistry, J., Schuster-Böckler, B., Griffiths-Jones, S., Hollich, V., Lassmann, T., Moxon, S., Marshall, M., Khanna, A., Durbin, R., Eddy, S. R., Sonnhammer, E. L. L. and Bateman, A. (2006). Pfam: Clans, web tools and services. Nucleic Acids Res. 34 D247-D51.
9. Galves, A., Galves, C., Garcia, N. and Peixoto, C. (2004). Correlates of rhythm in written texts of Brazilian and European Portuguese. Preprint. Available as Technical Report 08/08, IMECC/UNICAMP.
10. Galves, A., Maume-Deschamps, V. and Schmitt, B. (2008). Exponential inequalities for VMLC empirical trees. ESAIM Probab. Stat. 12 219-229.
11. Greig, D., Porteous, B. and Seheult, A. (1989). Exact maximum a posteriori estimation for binary images. J. Roy. Statist. Soc. Ser. B 51 271-279.
12. Kolmogorov, V. and Zabih, R. (2004). What energy functions can be minimized via graphs cuts? IEEE Trans. Pattern Analysis and Machine Intelligence 26 147-159.
13. Leonardi, F., Matioli, S. R., Armelin, H. A. and Galves, A. (2007). Detecting phylogenetic relations out from sparse context trees. Available at ArXiv:math/0804.4279.
14. Manly, B. F. J. (2007). Randomization, Bootstrap and Monte Carlo Methods in Biology 3rd ed. Chapman & Hall/CRC, New York.
15. Rissanen, J. (1983). A universal data compression system. IEEE Trans. Inform. Theory 29 656-664.
16. Ron, D., Singer, Y. and Tishby, N. (1996). The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning 25117-149.
17. Stein, L. (2001). Genome annotation: From sequence to biology. Nat. Rev. Genet. 2 493-505.
18. Wang, H., and Marron, J. S. (2007). Object oriented data analysis: Sets of trees. Ann. Statist. 35 1849-1873.
19. Wong, K. M., Suchard, M. A. and Huelsenbeck, J. P. (2008). Alignment uncertainty and genomic analysis. Science 319 473-476.