A method to infer X-trees (valued trees having X as set of leaves) from inc
omplete distance arrays (where some entries are uncertain or unknown) is de
scribed. It allows us to build an unrooted tree using only 2n-3 distance va
lues between the n elements of X, if they fulfill some explicit conditions.
This construction is based on the mapping between X-tree and a weighted ge
neralized 2-tree spanning X.