A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks

Documenti analoghi

• A branch-&-price approach to the unrooted maximum agreement forest problem
  di: Frohn, Martin, et al.
  Pubblicazione: (2024)
• Bounding the softwired parsimony score of a phylogenetic network
  di: Döcker, Janosch, et al.
  Pubblicazione: (2024)
• On properties driving diversity index selection
  di: Frohn, Martin, et al.
  Pubblicazione: (2025)
• Bounds on the sequence length sufficient to reconstruct binary level-$1$ phylogenetic networks under the CFN model
  di: Frohn, Martin, et al.
  Pubblicazione: (2025)
• A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
  di: Kelk, Steven, et al.
  Pubblicazione: (2026)