Computational support for case-heavy proofs in mathematical phylogenetics

Documenti analoghi

• A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
  di: Kelk, Steven, et al.
  Pubblicazione: (2026)
• Bounds on the sequence length sufficient to reconstruct binary level-$1$ phylogenetic networks under the CFN model
  di: Frohn, Martin, et al.
  Pubblicazione: (2025)
• Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
  di: Mestel, David, et al.
  Pubblicazione: (2024)
• Invariants for level-1 phylogenetic networks under the random walk 4-state Markov model
  di: Frohn, M., et al.
  Pubblicazione: (2024)
• Snakes and Ladders: a Treewidth Story
  di: Chaplick, Steven, et al.
  Pubblicazione: (2023)