The triangles method to build X-trees from incomplete distance matrices

@article{Gunoche2001TheTM,
  title={The triangles method to build X-trees from incomplete distance matrices},
  author={Alain Gu{\'e}noche and Bruno Leclerc},
  journal={RAIRO - Operations Research},
  year={2001},
  volume={35},
  pages={283-300}
}
A method to infer X-trees (valued trees having X as 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 fulfill some explicit conditions. This construction is based on the mapping between X-tree and a weighted generalized 2-tree spanningX. Résumé. On décrit une méthode pour la reconstruction des X-arbres (arbres valués admettant X… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Propriétés combinatoires des distances d’arbre : algorithmes et applications

  • V. Makarenkov
  • 1998
Highly Influential
6 Excerpts

On acyclical simplicial complexes

  • F. Harary, E. M. Palmer
  • Mathematika
  • 1968
Highly Influential
5 Excerpts

Minimum spanning trees for tree metrics: Abridgements and adjustments

  • B. Leclerc
  • estimation. Mol. Biol. Evol
  • 1996
Highly Influential
3 Excerpts

Approximation par arbre d’une distance partielle

  • A. Guénoche, S. S. Grandcolas
  • Math. Inform. Sci. Humaines
  • 1999
2 Excerpts

Pippert R.E. and Beineke L.W., Characterisation of 2-dimentional trees, edited by G

  • de l’EHESS, Paris
  • Chatrand
  • 1997

Similar Papers

Loading similar papers…