Pages that link to "Item:Q3073998"
From MaRDI portal
The following pages link to Combinatorics of least-squares trees (Q3073998):
Displaying 12 items.
- Minimum evolution using ordinary least-squares is less robust than neighbor-joining (Q263431) (← links)
- Combinatorics of non-ambiguous trees (Q402584) (← links)
- Robustness of phylogenetic inference based on minimum evolution (Q611949) (← links)
- The applicability of ordinary least squares to consistently short distances between taxa in phylogenetic tree construction and the normal distribution test consequences (Q1026639) (← links)
- Tree-tree matrices and other combinatorial problems from taxonomy (Q1911840) (← links)
- An algorithm for the fitting of a tree metric according to a weighted least-squares criterion (Q1962704) (← links)
- Consistent formulas for estimating the total lengths of trees (Q2486066) (← links)
- Tree composition condition and moments vanishing (Q3577803) (← links)
- On the combinatorics of leftist trees (Q5931792) (← links)
- A combinatorial approach to Golomb forests (Q5941521) (← links)
- Semi‐labeled unrooted binary tree optimization subject to nonnegativity (Q6066249) (← links)
- Expanding the class of global objective functions for dissimilarity-based hierarchical clustering (Q6187790) (← links)
