Lignende værker

• Computational support for case-heavy proofs in mathematical phylogenetics
  af: Forte, Luca, et al.
  Udgivet: (2025)
• Bounds on the sequence length sufficient to reconstruct binary level-$1$ phylogenetic networks under the CFN model
  af: Frohn, Martin, et al.
  Udgivet: (2025)
• Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
  af: Mestel, David, et al.
  Udgivet: (2024)
• Bounding the SNPR distance between two tree-child networks using generalised agreement forests
  af: Kelk, Steven, et al.
  Udgivet: (2025)
• Metrics for classes of semi-binary phylogenetic networks using $μ$-representations
  af: Reichling, Christopher, et al.
  Udgivet: (2024)