Pages that link to "Item:Q1074275"

The following pages link to Optimal algorithms for comparing trees with labeled leaves (Q1074275):

Displaying 31 items.

• On determining if tree-based networks contain fixed trees (Q309890) (← links)
• Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← 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)
• Enumeration of viral capsid assembly pathways: tree orbits under permutation group action (Q542011) (← links)
• Dissimilarity and similarity measures for comparing dendrograms and their applications (Q693037) (← links)
• Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
• An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
• An algebraic metric for phylogenetic trees (Q1033012) (← links)
• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves (Q1091713) (← links)
• On the use of ordered sets in problems of comparison and consensus of classifications (Q1104668) (← links)
• N-trees as nestings: Complexity, similarity, and consensus (Q1104670) (← links)
• The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
• The agreement metric for labeled binary trees (Q1340485) (← links)
• New Gromov-inspired metrics on phylogenetic tree space (Q1747644) (← links)
• Combining polynomial running time and fast convergence for the disk-covering method. (Q1872716) (← links)
• Constructing the R* consensus tree of two trees in subcubic time (Q1950390) (← links)
• Fast algorithms for the rooted triplet distance between caterpillars (Q2140512) (← links)
• Distribution and asymptotic behavior of the phylogenetic transfer distance (Q2313956) (← links)
• Approximating geodesic tree distance (Q2379945) (← links)
• Non-shared edges and nearest neighbor interchanges revisited (Q2390296) (← links)
• (Q2741329) (← links)
• Efficiently Calculating Evolutionary Tree Measures Using SAT (Q3637154) (← links)
• SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES (Q4652795) (← links)
• Rapidly computing the phylogenetic transfer index (Q5091744) (← links)
• Cache Oblivious Algorithms for Computing the Triplet Distance between Trees (Q5102045) (← links)
• A novel approach to phylogenetic trees: <i>d</i>‐Dimensional geometric Steiner trees (Q5191133) (← links)
• Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts (Q5298170) (← links)
• The asymmetric median tree. --- A new model for building consensus trees (Q5961632) (← links)
• Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks (Q6056548) (← links)
• The Bourque distances for mutation trees of cancers (Q6487648) (← links)