Treewidth-based algorithms for the small parsimony problem on networks

Treewidth-based algorithms for the small parsimony problem on networks

Abstract Background 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...

Full description

Bibliographic Details
Main Authors: Celine Scornavacca, Mathias Weller
Format: Article
Language:English
Published: BMC 2022-08-01
Series:Algorithms for Molecular Biology
Subjects:
Phylogenetics
Parsimony
Phylogenetic networks
Parameterized complexity
Dynamic programming
Treewidth
Online Access:https://doi.org/10.1186/s13015-022-00216-w

Internet

https://doi.org/10.1186/s13015-022-00216-w

Similar Items