Bounding the softwired parsimony score of a phylogenetic network
From MaRDI portal
Publication:6617639
DOI10.1007/S11538-024-01350-9MaRDI QIDQ6617639FDOQ6617639
Janosch Döcker, Simone Linz, Kristina Wicke
Publication date: 11 October 2024
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
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)
