A Note on Distinguishing Random Trees Populations

DOI10.1080/03610926.2011.579371zbMATH Open1298.62069OpenAlexW2013067939MaRDI QIDQ5299072FDOQ5299072

Ana Georgina Flesia

Publication date: 25 June 2013

Published in: Communications in Statistics: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610926.2011.579371

zbMATH Keywords

random treesprotein functionality

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Learning and adaptive systems in artificial intelligence (68T05) General biostatistics (92B15) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• The coalescent
• Algebraic Statistics for Computational Biology
• Object oriented data analysis: sets of trees
• The Multiplicative Process
• A universal data compression system
• Metric models for random graphs
• Limit theorems for sequences of random trees
• Variable length Markov chains
• Testing statistical hypothesis on random trees and applications to the protein classification problem
• Bootstrapping phylogenetic trees: theory and methods

Cited In (2)

• Title not available (Why is that?)
• Population persistence in Cayley trees

This page was built for publication: A Note on Distinguishing Random Trees Populations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5299072)