Reproduce “Rooted Almost-binary Phylogenetic Networks for which the Maximum Covering Subtree Problem is Solvable in Linear Time” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.