Skip to main content

Estimating Trees From Incomplete Distance Matrices: A Comparison of Two Methods

  • Conference paper
Data Analysis, Classification, and Related Methods

Abstract

In the present paper, we compare two methods (TRIANGLE and MW) for estimating trees from incomplete distances matrices through simulations. Our results illustrate that MW performs better for recovering path-length distances whereas TRIANGLE is superior in terms of topological recovery. Recommendations are provided as to which method should be used with real experimental data

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • DE SOETE, G. (1984): Additive-Tree Representations of Incomplete Dissimilarity Data. Quality and Quantity, 18, 387–393.

    Article  Google Scholar 

  • GUÉNOCHE, A. and LECLERC, B. (1998): La méthode des Triangles pour Reconstruire un Arbre à Partir de Distances Incomplètes. In: Actes des Journées de la Société Francophone de Classification. Agro-Montpellier, 117–120.

    Google Scholar 

  • GUÉNOCHE, A. and GRANDCOLAS, S. (1999): Approximations par Arbre d’une Distance Partielle. Mathématiques, Informatique et Sciences Humaines, 146, 51–64.

    Google Scholar 

  • HARARY, F. and PALMER, E. M. (1968): On Acyclical Simplicial Complexes. Matematika, 15, 115–122.

    Article  Google Scholar 

  • LANDRY, P.-A. and LAPOINTE, F.-J. (1997): Estimation of Missing Distances in Path-Length Matrices: Problems and Solutions. In: B. Mirkin, F.R. McMorris, F.S. Roberts, and A. Rzhetsky (Eds.): Mathematical hierarchies and biology. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, 209–224.

    Google Scholar 

  • LECLERC, B. and MAKARENKOV, V. (1998): On Some Relations Between 2-trees and Tree Metrics. Discrete Mathematics, 192, 223–249.

    Article  Google Scholar 

  • MAKARENKOV, V. and LECLERC, B. (1999): The Fitting of a Tree Metric According to a Weighted Least-Squares Criterion. Journal of Classification, 16, 3–26.

    Article  Google Scholar 

  • ROBINSON, D.F. and FOULDS, L.R. (1981): Comparison of Phylogenetic Trees. Mathematical Biosciences, 53, 131–147

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Levasseur, C., Landry, PA., Lapointe, FJ. (2000). Estimating Trees From Incomplete Distance Matrices: A Comparison of Two Methods. In: Kiers, H.A.L., Rasson, JP., Groenen, P.J.F., Schader, M. (eds) Data Analysis, Classification, and Related Methods. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59789-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59789-3_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67521-1

  • Online ISBN: 978-3-642-59789-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics