Year: 2025
Type: preprint
Abstract: In this note we demonstrate that a number of case-heavy combinatorial proofs in the mathematical phylogenetics literature can be proven more compactly using computational support. We use these techniques to also prove several new combinatorial lemmas that would have taken considerable effort to prove by hand. We are optimistic that similar approaches can be deployed more widely in phylogenetics.
Source: arXiv (Cornell University)
Authors: Forte, Luca, van Iersel, Leo, Kelk, Steven, Meuwese, Ruben
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: green
OpenAlex ID: W4417530971
Cites:
Cited by:
Related to: