2026-07-22T01:50:12Zhttps://repisalud.isciii.es/rest/oai/request
oai:repisalud.isciii.es:20.500.12105/227972024-11-28T20:28:23Zcom_20.500.12105_15322com_20.500.12105_2051col_20.500.12105_16967
Repisalud author Cardona, Gabriel author Carles Pons, Joan author Scornavacca, Celine 2024-09-10T13:10:30Z 2024-09-10T13:10:30Z 2019-09 Cardona G, Pons Mayol JC, Scornavacca C. Generation of Binary Tree-Child phylogenetic networks. PLoS Comput Biol. 2019 Sep;15(9):e1007347. 10.1371/journal.pcbi.1007347 1553-7358 PloS Computational Biology http://hdl.handle.net/20.500.13003/15131 31509525 L2003470944 2-s2.0-85072588228 https://hdl.handle.net/20.500.12105/22797 489741800040 Phylogenetic networks generalize phylogenetic trees by allowing the modelization of events of reticulate evolution. Among the different kinds of phylogenetic networks that have been proposed in the literature, the subclass of binary tree-child networks is one of the most studied ones. However, very little is known about the combinatorial structure of these networks. In this paper we address the problem of generating all possible binary tree-child (BTC) networks with a given number of leaves in an efficient way via reduction/augmentation operations that extend and generalize analogous operations for phylogenetic trees, and are biologically relevant. Since our solution is recursive, this also provides us with a recurrence relation giving an upper bound on the number of such networks. We also show how the operations introduced in this paper can be employed to extend the evolutive history of a set of sequences, represented by a BTC network, to include a new sequence. An implementation in python of the algorithms described in this paper, along with some computational experiments, can be downloaded from https://github.com/bielcardona/TCGenerators. eng Generation of Binary Tree-Child phylogenetic networks research article