On symmetries in phylogenetic trees

From MaRDI portal
Publication:311529

zbMATH Open1344.05045arXiv1602.07432MaRDI QIDQ311529FDOQ311529

Éric Fusy

Publication date: 13 September 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number an(sigma) of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with ngeq1 leaves, fixed (for the relabelling action) by a given permutation sigmainfrakSn. Denoting by lambdavdashn the integer partition giving the sizes of the cycles of sigma in non-increasing order, they show by a guessing/checking approach that if lambda is a binary partition (it is known that an(sigma)=0 otherwise), then a_n(sigma)=prod_{i=2}^{ell(lambda)}(2(lambda_i+cdots+lambda_{ell(lambda)})-1), and they derive from it a formula and random generation procedure for tanglegrams (and more generally for tangled chains). Our main result is a combinatorial proof of the formula, which yields a simplification of the random sampler for tangled chains.


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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)





Cites Work


Cited In (9)






This page was built for publication: On symmetries in phylogenetic trees

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