Counting and enumerating tree-child networks and their subclasses

Show simple item record

dc.contributor.author Cardona, Gabriel
dc.contributor.author Zhang, Louxin
dc.date.accessioned 2023-12-22T09:17:00Z
dc.identifier.uri http://hdl.handle.net/11201/163346
dc.description.abstract [eng] Galled trees are studied as a recombination model in population genetics. This class of phylogenetic networks is generalized into tree-child and galled network classes by relaxing a structural condition imposed on galled trees. We provide a solution to an open problem that is how to count and enumerate tree-child networks with fixed number of leaves and reticulations. Explicit counting formulas are also given for galled trees through their relationship to ordered trees and phylogenetic networks in which the child of each reticulation is a leaf.
dc.format application/pdf
dc.relation.isformatof Versió postprint del document publicat a: https://doi.org/10.1016/j.jcss.2020.06.001
dc.relation.ispartof Journal of Computer and System Sciences, 2020, vol. 114, p. 84-104
dc.rights (c) Academic Press, 2020
dc.subject.classification 51 - Matemàtiques
dc.subject.classification 004 - Informàtica
dc.subject.other 51 - Mathematics
dc.subject.other 004 - Computer Science and Technology. Computing. Data processing
dc.title Counting and enumerating tree-child networks and their subclasses
dc.type info:eu-repo/semantics/article
dc.type info:eu-repo/semantics/acceptedVersion
dc.date.updated 2023-12-22T09:17:00Z
dc.date.embargoEndDate
dc.embargo
dc.rights.accessRights info:eu-repo/semantics/embargoedAccess
dc.identifier.doi https://doi.org/10.1016/j.jcss.2020.06.001


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


Advanced Search

Browse

My Account

Statistics