Related Experiment Video
Updated: Jul 19, 2026

Evaluating Dryocosmus Kuriphilus-induced Damage on Castanea Sativa
Published on: August 30, 2018
A concise necessary and sufficient condition for the existence of a galled-tree
1Department of Computer Science, University of California at Davis, Davis, CA 95616, USA. yssong@cs.ucdavis.edu
Abstract:
Galled-trees are a special class of graphical representation of evolutionary history that has proven amenable to efficient, polynomial-time algorithms. The goal of this paper is to construct a concise necessary and sufficient condition for the existence of a galled-tree for M, a set of binary sequences that purportedly have evolved in the presence of recombination. Both root-known and root-unknown cases are considered here.
Related Concept Videos
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Green’s Theorem
Extended Versions of Green’s Theorem
Fundamental Theorem of Algebra
Phylogenetic Trees
Phylogenetic Trees

