On low treewidth graphs and supertrees

A. Grigoriev*, S. Kelk, L. Lekic

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review


Compatibility of unrooted phylogenetic trees is a well studied problem in phylogenetics. It asks to determine whether for a set of k input trees T 1,...,T k there exists a larger tree (called a supertree) that contains the topologies of all k input trees. When any such supertree exists we call the instance compatible and otherwise incompatible. It is known that the problem is NP-hard and FPT, although a constructive FPT algorithm is not known. It has been shown that whenever the treewidth of an auxiliary structure known as the display graph is strictly larger than the number of input trees, the instance is incompatible. Here we show that whenever the treewidth of the display graph is at most 2, the instance is compatible. Furthermore, we give a polynomial-time algorithm to construct a supertree in this case. Finally, we demonstrate both compatible and incompatible instances that have display graphs with treewidth 3, highlighting that the treewidth of the display graph is (on its own) not sufficient to determine compatibility.
Original languageEnglish
Title of host publicationAlgorithms for Computational Biology
Subtitle of host publicationAICoB 2014 International Conference on Algorithms for Computational Biology
EditorsA. Horia Dediu, C. Martín-Vide, B. Truthe
Place of PublicationSwitzerland
Number of pages12
ISBN (Print)978-3-319-07952-3
Publication statusPublished - 1 Jan 2014

Publication series

SeriesLecture Notes in Computer Science

Cite this