Build
The Build algorithm, described in "Inferring a tree from lowest commen ancestors with the application
to the optimization of relational expressions" from Aho et al. (1981), is one of the first methods that builds a supertree.
The original purpose of the method was to construct a tree to to satisfy a set of lineage constraints of commen ancestor,
whereby these trees where ment to be used for relational database queries.
The Build algorithm takes as input a set of constraints in the form (a,b) < (c,d), meaning that the lowest commen ancestor
of a and b is a proper descendent of the lowest commen ancestor of c and d.
A disadvantage of this algorithm is that it only returns a tree if the input is compatible, i.e not conflicting.
Nevertheless, the Build algorithm builds the basis for the most graph-based supertree methods.