Reduction rules for the maximum parsimony distance on phylogenetic trees

Kelk, Steven, Fischer, Mareike, Moulton, Vincent ORCID: and Wu, Taoyang ORCID: (2016) Reduction rules for the maximum parsimony distance on phylogenetic trees. Theoretical Computer Science, 646. pp. 1-15. ISSN 0304-3975

[thumbnail of Manuscript]
PDF (Manuscript) - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (699kB) | Preview


In phylogenetics, distances are often used to measure the incongruence between a pair of phylogenetic trees that are reconstructed by different methods or using different regions of genome. Motivated by the maximum parsimony principle in tree inference, we recently introduced the maximum parsimony (MP) distance, which enjoys various attractive properties due to its connection with several other well-known tree distances, such as tbr and spr. Here we show that computing the MP distance between two trees, a NP-hard problem in general, is fixed parameter tractable in terms of the tbr distance between the tree pair. Our approach is based on two reduction rules – the chain reduction and the subtree reduction – that are widely used in computing tbr and spr distances. More precisely, we show that reducing chains to length 4 (but not shorter) preserves the MP distance. In addition, we describe a generalization of the subtree reduction which allows the pendant subtrees to be rooted in different places, and show that this still preserves the MP distance. On a slightly different note we also show that Monadic Second Order Logic (MSOL), posited over an auxiliary graph structure known as the display graph (obtained by merging the two trees at their leaves), can be used to obtain an alternative proof that computation of MP distance is fixed parameter tractable in terms of tbr-distance. We conclude with an extended discussion in which we focus on similarities and differences between MP distance and TBR distance and present a number of open problems. One particularly intriguing question, emerging from the MSOL formulation, is whether two trees with bounded MP distance induce display graphs of bounded treewidth.

Item Type: Article
Uncontrolled Keywords: phylogenetics,parsimony,fixed parameter tractability,chain,incongruence,treewidth
Faculty \ School: Faculty of Science > School of Computing Sciences
Depositing User: Pure Connector
Date Deposited: 24 Sep 2016 00:02
Last Modified: 22 Oct 2022 01:19
DOI: 10.1016/j.tcs.2016.07.010

Actions (login required)

View Item View Item