Inferring phylogenetic networks from multifurcating trees via cherry picking and machine learning

Giulia Bernardini*, Leo van Iersel, Esther Julien, Leen Stougie

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

The Hybridization problem asks to reconcile a set of conflicting phylogenetic trees into a single phylogenetic network with the smallest possible number of reticulation nodes. This problem is computationally hard and previous solutions are limited to small and/or severely restricted data sets, for example, a set of binary trees with the same taxon set or only two non-binary trees with non-equal taxon sets. Building on our previous work on binary trees, we present FHyNCH, the first algorithmic framework to heuristically solve the Hybridization problem for large sets of multifurcating trees whose sets of taxa may differ. Our heuristics combine the cherry-picking technique, recently proposed to solve the same problem for binary trees, with two carefully designed machine-learning models. We demonstrate that our methods are practical and produce qualitatively good solutions through experiments on both synthetic and real data sets.

Original languageEnglish
Article number108137
Number of pages12
JournalMolecular Phylogenetics and Evolution
Volume199
Issue numberOctober
DOIs
Publication statusPublished - Oct 2024

Bibliographical note

Publisher Copyright:
© 2024 The Author(s)

Funding

FundersFunder number
MUR
Nederlandse Organisatie voor Wetenschappelijk Onderzoek
PANGAIA
Horizon 2020 Framework Programme
FSE
ALPACA
NWOOCENW.GROOT.2019.015
H2020 Marie Skłodowska-Curie Actions872539, 956229
H2020 Marie Skłodowska-Curie Actions

    Keywords

    • Cherry-picking
    • Heuristic
    • Hybrid phylogeny
    • Hybridization problem
    • Machine learning

    Fingerprint

    Dive into the research topics of 'Inferring phylogenetic networks from multifurcating trees via cherry picking and machine learning'. Together they form a unique fingerprint.

    Cite this