Merging partially labelled trees: hardness and a declarative programming solution

Anthony Labarre 1, * Sicco Verwer 2
* Corresponding author
1 AlgoB
LIGM - Laboratoire d'Informatique Gaspard-Monge
Abstract : Intraspecific studies often make use of haplotype networks instead of gene genealogies to represent the evolution of a set of genes. Cassens et al. proposed one such network reconstruction method, based on the global maximum parsimony principle, which was later recast by the first author of the present work as the problem of finding a minimum common supergraph of a set of t partially labelled trees. Although algorithms were proposed for solving the problem on two graphs, the complexity of the general problem remains unknown. In this paper, we show that the corresponding decision problem is NP-complete for t = 3. We then propose a declarative programming approach to solving the problem to optimality in practice, as well as a heuristic approach, both based on the IDP system, and assess the performance of both methods on randomly generated data.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00855669
Contributor : Anthony Labarre <>
Submitted on : Monday, July 7, 2014 - 6:40:26 PM
Last modification on : Thursday, July 5, 2018 - 2:46:12 PM
Long-term archiving on : Tuesday, October 7, 2014 - 10:36:36 AM

File

ump-is-hard-shortened.pdf
Files produced by the author(s)

Identifiers

Citation

Anthony Labarre, Sicco Verwer. Merging partially labelled trees: hardness and a declarative programming solution. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2014, 11 (2), pp.389-397. ⟨10.1109/TCBB.2014.2307200⟩. ⟨hal-00855669⟩

Share

Metrics

Record views

327

Files downloads

223