The following pages link to Comparison of phylogenetic trees (Q1148241):
Displayed 35 items.
- Reconstructing the shape of a tree from observed dissimilarity data (Q103560) (← 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)
- Assessing congruence among ultrametric distance matrices (Q734390) (← 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)
- Landscapes on spaces of trees (Q1855800) (← links)
- Non-shared edges and nearest neighbor interchanges revisited (Q2390296) (← links)
- Tripartitions do not always discriminate phylogenetic networks (Q2476109) (← links)
- A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance (Q2563540) (← links)
- Hierarchical clustering based on ordinal consistency (Q2568083) (← links)
- Scatter search with path relinking for phylogenetic inference (Q2570151) (← links)
- The triangles method to build<i>X</i>-trees from incomplete distance matrices (Q2773174) (← links)
- Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges (Q2884008) (← links)
- DISTANCE-BASED PHYLOGENETIC ALGORITHMS: NEW INSIGHTS AND APPLICATIONS (Q3161625) (← links)
- An Evolutionary Distance Based on Maximal Unique Matches (Q3562416) (← links)
- SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES (Q4652795) (← links)
- A novel approach to phylogenetic trees: <i>d</i>‐Dimensional geometric Steiner trees (Q5191133) (← links)
- Comparing and Aggregating Partially Resolved Trees (Q5458518) (← links)
- Finding similar consensus between trees: An algorithm and a distance hierarchy (Q5926038) (← links)
- Some statistical methods for phylogenetic trees with application to HIV disease (Q5938273) (← links)