The reconstruction process consists of finding a minimum branching (i.e.
a directed minimum spanning tree) for a weighted directed graph obtained from assigning a cost c(i, j) to each arc (i, j) of the following directed graph: we will find a dependency tree T = (V w , A T ⊆ A(U )) such that the sum of costs of the arcs in A T is minimal.