Skip to Main content Skip to Navigation
Conference papers

Treewidth-Based Algorithms for the SmallParsimony Problem on Networks

Abstract : Phylogenetic reconstruction is one of the paramount challenges of contemporary bioinformatics. A subtask of existing tree reconstruction algorithms is modeled by the Small Parsimony problem: given a tree T and an assignment of character-states to its leaves, assign states to the internal nodes of T such as to minimize the parsimony score, that is, the number of edges of T connecting nodes with different states. While this problem is polynomial-time solvable on trees, the matter is more complicated if T contains reticulate events such as hybridizations or recombinations, i.e. when T is a network. Indeed, three different versions of the parsimony score on networks have been proposed and each of them is NP-hard to decide. Existing parameterized algorithms focus on combining the number of possible character-states with the number of reticulate events (per biconnected component). Here, we consider the treewidth of the undirected graph underlying the input network as parameter, presenting dynamic programming algorithms for (slight generalizations of) all three versions of the parsimony problem on networks. Our algorithms use a formulation of the treewidth that may facilitate formalizing treewidth-based dynamic programming algorithms on phylogenetic networks for other problems .
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03287112
Contributor : Celine Scornavacca Connect in order to contact the contributor
Submitted on : Thursday, July 15, 2021 - 2:03:19 PM
Last modification on : Monday, October 18, 2021 - 4:09:58 PM
Long-term archiving on: : Saturday, October 16, 2021 - 6:33:03 PM

File

tw.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Celine Scornavacca, Mathias Weller. Treewidth-Based Algorithms for the SmallParsimony Problem on Networks. 21st International Workshop on Algorithms in Bioinformatics (WABI), Aug 2021, Chicago. Due to COVID-19, WABI 2021 will be held online., United States. pp.6:1, ⟨10.4230/LIPIcs.WABI.2021.6⟩. ⟨hal-03287112⟩

Share

Metrics

Record views

53

Files downloads

79