... components, each with at most n leaves, and such a node can be found in linear time in T such that each of the trees in T - {v} has at most n leaves An internal node v of T having such a property is called ... und Angewandte Mathematik 1869, 70:185-190 Kannan SK, Lawler EL, Warnow T: Determining the evolutionary tree using experiments Journal of Algorithms 1996, 21:26-50 Kao MY, Lingas A, Östlin A: Balanced ... called a separator of T Notice that a phylogeny T may have more than one separator, but our algorithms in Tables 1, 2, and need only one of them Given a phylogeny T and a separator v of T, we can...