Treewidth distance on phylogenetic trees

Steven Kelk, Georgios Stamoulis, Taoyang Wu

Research output: Contribution to journalArticle

4 Citations (Scopus)
15 Downloads (Pure)

Abstract

In this article we study the treewidth of the display graph, an auxiliary graph structure obtained from the fusion of phylogenetic (i.e., evolutionary) trees at their leaves. Earlier work has shown that the treewidth of the display graph is bounded if the trees are in some formal sense topologically similar. Here we further expand upon this relationship. We analyse a number of reduction rules, commonly used in the phylogenetics literature to obtain fixed parameter tractable algorithms. In some cases (the subtree reduction) the reduction rules behave similarly with respect to treewidth, while others (the cluster reduction) behave very differently, and the behaviour of the chain reduction is particularly intriguing because of its link with graph separators and forbidden minors. We also show that the gap between treewidth and Tree Bisection and Reconnect (TBR) distance can be infinitely large, and that unlike, for example, planar graphs the treewidth of the display graph can be as much as linear in its number of vertices. A number of other auxiliary results are given. We conclude with a discussion and list a number of open problems.
Original languageEnglish
Pages (from-to)99-117
Number of pages19
JournalTheoretical Computer Science
Volume731
Early online date18 Apr 2018
DOIs
Publication statusPublished - 30 Jun 2018

Keywords

  • Graph Theory
  • Phylogenetics
  • Treewidth
  • Algorithmic Graph Theory
  • Computational Biology

Cite this