Bounding the softwired parsimony score of a phylogenetic network

DOI10.1007/S11538-024-01350-9MaRDI QIDQ6617639FDOQ6617639

Authors: Janosch Döcker, Simone Linz, Kristina Wicke 

Publication date: 11 October 2024

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Recommendations

• On computing the maximum parsimony score of a phylogenetic network
• On the quirks of maximum parsimony and likelihood on phylogenetic networks
• Finding a most parsimonious or likely tree in a network with respect to an alignment
• Treewidth-Based Algorithms for the Small Parsimony Problem on Networks

zbMATH Keywords

phylogenetic networkslevel-\(k\)parental parsimonysoftwired parsimony

Mathematics Subject Classification ID

Problems related to evolution (92D15)

Cites Work

• On the maximum parsimony distance between phylogenetic trees
• Folding and unfolding phylogenetic trees and networks
• Distinguishing phylogenetic networks
• On the complexity of computing MP distance between binary phylogenetic trees
• Finding a most parsimonious or likely tree in a network with respect to an alignment
• On computing the maximum parsimony score of a phylogenetic network
• Identifiability in phylogenetics using algebraic matroids
• Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks

This page was built for publication: Bounding the softwired parsimony score of a phylogenetic network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617639)