gjospin/PhyloSift — Issue #105: identify maximal concordant sets of subtrees
Author: koadman
Created: 2012-02-29 17:15:56+00:00
State: open

find or write an algorithm that, given two trees where one may have each taxon exactly once and the other may have many or no instances of each taxon, identifies maximal disjoint clades in the second tree that are topologically congruent with the first tree. The definition of maximal in this context is open to interpretation.