scientific article; zbMATH DE number 871934

MaRDI QIDQ4875208zbMATH OpenFDO

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

Publication date 5 January 1997

zbMATH Keywords

algorithmdistance matrixtree metricdistances fittingnumerical taxonomy problem

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10)

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

Cited in

(11)

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

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)