A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees

Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

Abstract

We present the first fixed-parameter algorithm for constructing a tree-child phylogenetic network that displays an arbitrary number of binary input trees and has the minimum number of reticulations among all such networks. The algorithm uses the recently introduced framework of cherry picking sequences and runs in O((8 k) kpoly (n, t)) time, where n is the number of leaves of every tree, t is the number of trees, and k is the reticulation number of the constructed network. Moreover, we provide an efficient parallel implementation of the algorithm and show that it can deal with up to 100 input trees on a standard desktop computer, thereby providing a major improvement over previous phylogenetic network construction methods.

Original languageEnglish
Pages (from-to)917-960
Number of pages44
JournalAlgorithmica
Volume84
Issue number4
DOIs
Publication statusPublished - 2022

Bibliographical note

Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.

Keywords

  • Fixed-parameter algorithms
  • Hybridization number
  • Phylogenetic networks

Fingerprint

Dive into the research topics of 'A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees'. Together they form a unique fingerprint.

Cite this