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

DOI10.1214/08-AOAS218zbMath1166.62079arXivmath/0603378WikidataQ105584241 ScholiaQ105584241MaRDI QIDQ2270660

Ana Georgina Flesia, Sebastian P. Grynberg, Jorge R. Busch, Florencia Leonardi, Pablo A. Ferrari, Ricardo Fraiman

Publication date: 29 July 2009

Published in: The Annals of Applied Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0603378

zbMATH Keywords

hypothesis testing; random trees; protein classification; variable length Markov chains

Mathematics Subject Classification ID

62G10: Nonparametric hypothesis testing

62H30: Classification and discrimination; cluster analysis (statistical aspects)

62P10: Applications of statistics to biology and medical sciences; meta analysis

05C90: Applications of graph theory

05C80: Random graphs (graph-theoretic aspects)

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

92C40: Biochemistry, molecular biology

Related Items

Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm, A Note on Distinguishing Random Trees Populations, Limit theorems for sequences of random trees, Context tree selection: a unifying view, Nonparametric statistical inference for the context tree of a stationary ergodic process, Variable length memory chains: characterization of stationary probability measures, Coupling and perturbation techniques for categorical time series, A note on density estimation for binary sequences, Detecting renewal states in chains of variable length via intrinsic Bayes factors, Overview of object oriented data analysis

Uses Software

• Pfam

Cites Work

• Limit theorems for sequences of random trees
• The power of amnesia: Learning probabilistic automata with variable memory length
• Metric models for random graphs
• Variable length Markov chains
• Object oriented data analysis: sets of trees
• Alignment Uncertainty and Genomic Analysis
• Context tree estimation for not necessarily finite memory processes, via BIC and MDL
• A universal data compression system
• Exponential inequalities for VLMC empirical trees
• Unnamed Item
• Unnamed Item