کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
421181 684158 2013 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Generating functions for multi-labeled trees
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Generating functions for multi-labeled trees
چکیده انگلیسی

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, we prove 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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 161, Issues 1–2, January 2013, Pages 107–117
نویسندگان
, , , ,