Bounding the number of reticulations in a tree-child network that displays a set of trees

DOI10.1007/978-3-031-36911-7_11zbMath1530.92164arXiv2311.18218MaRDI QIDQ6086509

No author found.

Publication date: 12 December 2023

Published in: Comparative Genomics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmphylogenetic networkphylogeneticstree-child network

Mathematics Subject Classification ID

Problems related to evolution (92D15) Linear programming (90C05)

Cites Work

• Unnamed Item
• A decomposition theorem and two algorithms for reticulation-visible networks
• A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
• Counting and enumerating galled networks
• Counting and enumerating tree-child networks and their subclasses
• On the asymptotic growth of the number of tree-child networks
• Locating a Tree in a Phylogenetic Network in Quadratic Time
• Phylogeny
• The Fine Structure of Galls in Phylogenetic Networks

This page was built for publication: Bounding the number of reticulations in a tree-child network that displays a set of trees