scientific article; zbMATH DE number 871934

zbMATH Open0853.65014MaRDI QIDQ4875208FDOQ4875208

Authors: Richa Agarwala, Vineet Bafna, Martin Farach, Babu Narayanan, Mikkel Thorup, Mike Paterson 

Publication date: 5 January 1997

Title of this publication is not available (Why is that?)

Recommendations

• On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
• Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
• scientific article; zbMATH DE number 1222844
• An algorithm for the fitting of a tree metric according to a weighted least-squares criterion

zbMATH Keywords

algorithmdistance matrixtree metricdistances fittingnumerical taxonomy problem

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10)

Cited In (11)

• Automated category tree construction: hardness bounds and algorithms
• An algorithm for the fitting of a tree metric according to a weighted least-squares criterion
• A constructive algorithm for realizing a distance matrix
• Inferring evolutionary trees with strong combinatorial evidence
• \(l_\infty\)-approximation via subdominants.
• A few logs suffice to build (almost) all trees. II
• Counting distance permutations
• A few logs suffice to build (almost) all trees (I)
• Title not available (Why is that?)
• On approximating planar metrics by tree metrics.
• Constructing big trees from short sequences

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875208)