The following pages link to Comparison of phylogenetic trees (Q1148241):
Displayed 50 items.
- Reconstructing the shape of a tree from observed dissimilarity data (Q103560) (← links)
- On the maximum parsimony distance between phylogenetic trees (Q259724) (← links)
- Minimum tree cost quartet puzzling (Q263274) (← links)
- TreeOfTrees method to evaluate the congruence between gene trees (Q263301) (← links)
- Minkowski generalizations of Ward's method in hierarchical clustering (Q288984) (← links)
- A `stochastic safety radius' for distance-based tree reconstruction (Q289927) (← links)
- Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees (Q328699) (← links)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← links)
- Comparing and simplifying distinct-cluster phylogenetic networks (Q505705) (← links)
- Discriminative measures for comparison of phylogenetic trees (Q516872) (← links)
- A cubic-time algorithm for computing the trinet distance between level-1 networks (Q522967) (← links)
- Polyhedral geometry of phylogenetic rogue taxa (Q545631) (← links)
- Reconstructing evolution of sequences subject to recombination using parsimony (Q584109) (← links)
- Nodal distances for rooted phylogenetic trees (Q604511) (← links)
- Phylogenetic analysis of DNA sequences with a novel characteristic vector (Q645153) (← links)
- Comparing and aggregating partially resolved trees (Q650896) (← links)
- Principal components analysis in the space of phylogenetic trees (Q661179) (← links)
- Approximating maximum agreement forest on multiple binary trees (Q727962) (← links)
- Assessing congruence among ultrametric distance matrices (Q734390) (← links)
- A note on the path interval distance (Q738567) (← links)
- Algorithms for parameterized maximum agreement forest problem on multiple trees (Q744101) (← links)
- A tabu search algorithm for maximum parsimony phylogeny inference (Q853081) (← links)
- The mean value of the squared path-difference distance for rooted phylogenetic trees (Q986580) (← links)
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks (Q996826) (← links)
- A new quartet approach for reconstructing phylogenetic trees: Quartet joining method (Q1029709) (← links)
- An algebraic metric for phylogenetic trees (Q1033012) (← links)
- Approximating minimum-length-sequence metrics: A cautionary note (Q1050904) (← links)
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces (Q1056946) (← links)
- A computationally efficient approximation to the nearest neighbor interchange metric (Q1057598) (← links)
- Optimal algorithms for comparing trees with labeled leaves (Q1074275) (← links)
- On the use of ordered sets in problems of comparison and consensus of classifications (Q1104668) (← links)
- Estimating divergence times (Q1109710) (← links)
- Choosing the tree which actually best explains the data: another look at the bootstrap in phylogenetic reconstruction. (Q1566634) (← links)
- Improving mixture tree construction using better EM algorithms (Q1623443) (← links)
- Dimension reduction in principal component analysis for trees (Q1623457) (← links)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
- New Gromov-inspired metrics on phylogenetic tree space (Q1747644) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Landscapes on spaces of trees (Q1855800) (← links)
- Greedy learning of latent tree models for multidimensional clustering (Q2260930) (← links)
- Phylogenetic analysis of DNA sequences based on the generalized pseudo-amino acid composition (Q2261650) (← links)
- Suppression distance computation for hierarchical clusterings (Q2346561) (← links)
- A parsimony-based metric for phylogenetic trees (Q2348152) (← links)
- Neighborhoods of trees in circular orderings (Q2352433) (← links)
- Robust classifying of prokaryotic genomes (Q2359344) (← links)
- Non-shared edges and nearest neighbor interchanges revisited (Q2390296) (← links)
- Distributions of topological tree metrics between a species tree and a gene tree (Q2397338) (← links)
- Comparison of alignment free string distances for complete genome phylogeny (Q2442771) (← links)
- Tripartitions do not always discriminate phylogenetic networks (Q2476109) (← links)
- A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance (Q2563540) (← links)