Czabarka, É. and Erdős, Péter and Johnson, V. and Moulton, V. (2013) Generating functions for multi-labeled trees. DISCRETE APPLIED MATHEMATICS, 161 (1-2). pp. 107-117. ISSN 0166-218X
|
Text
CEJM-final.pdf Download (169kB) | Preview |
Abstract
Multi-labeled trees are a generalization of phylogenetic trees that are used, for example, in the study of gene versus species evolution and as the basis for phylogenetic network construction. Unlike phylogenetic trees, in a leaf-multi-labeled tree it is possible to label more than one leaf by the same element of the underlying label set. In this paper we derive formulae for generating functions of leaf-multi-labeled trees and use these to derive recursions for counting such trees. In particular,weprove results which generalize previous theorems by Harding on so-called tree-shapes, and by Otter on relating the number of rooted and unrooted phylogenetic trees.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | bioinformatics; Trees (mathematics); Species evolution; Recursions; PHYLOGENETIC TREES; Phylogenetic Networks; Generating functions; phylogenetic tree; Multi-labeled tree; MUL-tree; generating function |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 06 Feb 2014 05:40 |
| Last Modified: | 08 Feb 2014 08:01 |
| URI: | http://real.mtak.hu/id/eprint/9901 |
Actions (login required)
 |
Edit Item |
