2000 character limit reached
The disentangling number for phylogenetic mixtures (1107.2880v1)
Published 14 Jul 2011 in math.CO and q-bio.PE
Abstract: We provide a logarithmic upper bound for the disentangling number on unordered lists of leaf labeled trees. This results is useful for analyzing phylogenetic mixture models. The proof depends on interpreting multisets of trees as high dimensional contingency tables.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.