A Database Approach to Solve the Tree Containment Problem in Phylogenetic Networks - Archive ouverte HAL
Communication Dans Un Congrès Année : 2023

A Database Approach to Solve the Tree Containment Problem in Phylogenetic Networks

Résumé

The Tree Containment problem consists in deciding whether a phylogenetic tree is displayed by a phylogenetic network. It is NP-hard in general, although polynomial-time algorithms were found for restricted cases when constraints are given on thestructure of the phylogenetic network. Considering this problem as a special case of directed subgraph homeomorphism allows us to design several new algorithmic approaches to address it efficiently in practice, using the pebble game algorithm introduced to solve this problem. After proposing a SAT formulation of the problem, we turn to database theory, by first showing how to design a Datalog program to solve the problem. We then show how to optimize this approach to solve the problem faster in practice.
Fichier principal
Vignette du fichier
2023_Sep-Math-Evol-Sci-Rpt_1-BBGST2023.pdf (137.79 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Copyright (Tous droits réservés)

Dates et versions

hal-04722546 , version 1 (08-10-2024)

Licence

Copyright (Tous droits réservés)

Identifiants

  • HAL Id : hal-04722546 , version 1

Citer

Sarah J. Berkemer, Pierre Bourhis, Philippe Gambette, Lionel Seinturier, Marion Tommasi. A Database Approach to Solve the Tree Containment Problem in Phylogenetic Networks. Mathematics of Evolution - Phylogenetic Trees and Networks. Workshop 1: Foundations of Phylogenetic Networks, Sep 2023, Singapour, Singapore. pp.5-8. ⟨hal-04722546⟩
0 Consultations
0 Téléchargements

Partager

More