Pages that link to "Item:Q1306399"

The following pages link to Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices (Q1306399):

Displaying 15 items.

• Finding the closest ultrametric (Q476304) (← links)
• On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
• Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees (Q975453) (← links)
• The complexity of ultrametric partitions on graphs (Q1098632) (← links)
• An optimal algorithm to reconstruct trees from additive distance data (Q1121819) (← links)
• Fitting distances by tree metrics with increment error (Q1306400) (← links)
• Data model and classification by trees; The minimum variance reduction (MVR) method (Q1584597) (← links)
• Testing metric properties (Q1877548) (← links)
• A robust model for finding optimal evolutionary tree (Q1902471) (← links)
• Minimum spanning paths and Hausdorff distance in finite ultrametric spaces (Q2152004) (← links)
• Tree edge decomposition with an application to minimum ultrametric tree approximation (Q2369981) (← links)
• Scatter search with path relinking for phylogenetic inference (Q2570151) (← links)
• (Q4218433) (← links)
• The minimum evolution problem: Overview and classification (Q5191134) (← links)
• Algorithms and Computation (Q5712119) (← links)