On computing the maximum parsimony score of a phylogenetic network

M Fischer, LJJ van Iersel, Steven Kelk, C Scornavacca

Research output: Contribution to journalArticleScientificpeer-review

11 Citations (Scopus)

Abstract

Phylogenetic networks are used to display the relationship among different species whose evolution is not treelike, which is the case, for instance, in the presence of hybridization events or horizontal gene transfers. Tree inference methods such as maximum parsimony need to be modified in order to be applicable to networks. In this paper, we discuss two different definitions
of maximum parsimony on networks, “hardwired” and “softwired,” and examine the complexity of computing them given a network topology and a character. By exploiting a link with the problem Multiterminal Cut, we show that computing the hardwired parsimony score for 2-state characters is polynomial-time solvable, while for characters with more states this problem becomes NP-hard
but is still approximable and fixed parameter tractable in the parsimony score. On the other hand we show that, for the softwired definition, obtaining even weak approximation guarantees is already difficult for binary characters and restricted network topologies, and fixed-parameter tractable algorithms
in the parsimony score are unlikely. On the positive side we show that computing the softwired parsimony score is fixed-parameter tractable in the level of the network, a natural parameter describing how tangled reticulate activity is in the network. Finally, we show that both the hardwired and
the softwired parsimony scores can be computed efficiently using integer linear programming. The software has been made freely available.
Original languageEnglish
Pages (from-to)559-585
Number of pages27
JournalSIAM Journal on Discrete Mathematics
Volume29
Issue number1
DOIs
Publication statusPublished - 2015

Fingerprint

Dive into the research topics of 'On computing the maximum parsimony score of a phylogenetic network'. Together they form a unique fingerprint.

Cite this