| Article ID: | iaor20053275 |
| Country: | France |
| Volume: | 35 |
| Issue: | 2 |
| Start Page Number: | 283 |
| End Page Number: | 300 |
| Publication Date: | Apr 2001 |
| Journal: | RAIRO Operations Research |
| Authors: | Gunoche Alain, Leclerc Bruno |
A method to infer X-trees (valued trees having X as a set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2n-3 distance values between the n elements of X, if they fulfil some explicit conditions. This construction is based on the mapping between X-tree and a weighted generalized 2-tree spanning X.