Pages that link to "Item:Q1914784"

The following pages link to Extension operations on sets of leaf-labelled trees (Q1914784):

Displaying 50 items.

• Some axiomatic limitations for consensus and supertree functions on hierarchies (Q307637) (← links)
• Mathematical aspects of phylogenetic groves (Q360362) (← links)
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
• Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
• Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
• `Bureaucratic' set systems, and their role in phylogenetics (Q449344) (← links)
• A characterization of dissimilarity families of trees (Q507573) (← links)
• Treelike quintet systems (Q510878) (← links)
• Building species trees from larger parts of phylogenomic databases (Q553332) (← links)
• Graph triangulations and the compatibility of unrooted phylogenetic trees (Q628277) (← links)
• Slim sets of binary trees (Q654890) (← links)
• Groves of phylogenetic trees (Q659789) (← links)
• Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
• Encoding phylogenetic trees in terms of weighted quartets (Q938146) (← links)
• Quartet compatibility and the quartet graph (Q1010830) (← links)
• Phylogenetic graph models beyond trees (Q1026198) (← links)
• On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
• Characterizing phylogenetically decisive taxon coverage (Q1049263) (← links)
• Convex tree realizations of partitions (Q1195647) (← links)
• The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
• A supertree method for rooted trees (Q1582076) (← links)
• Minimum triplet covers of binary phylogenetic \(X\)-trees (Q1679026) (← links)
• Phylogenetic flexibility via Hall-type inequalities and submodularity (Q1736949) (← links)
• The matroid structure of representative triple sets and triple-closure computation (Q1746594) (← links)
• Inferring phylogenetic trees from the knowledge of rare evolutionary events (Q1750644) (← links)
• Quarnet inference rules for level-1 networks (Q1786927) (← links)
• Reconstructing gene trees from Fitch's xenology relation (Q1789081) (← links)
• Explosions and hot spots in supertree methods (Q1795094) (← links)
• Reconstructing minimal rooted trees. (Q1811070) (← links)
• A few logs suffice to build (almost) all trees. II (Q1960520) (← links)
• The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees (Q1962070) (← links)
• Tree representations of non-symmetric group-valued proximities (Q1970526) (← links)
• Corrigendum to: ``Best match graphs'' (Q2022091) (← links)
• On the comparison of incompatibility of split systems across different numbers of taxa (Q2035794) (← links)
• Indirect identification of horizontal gene transfer (Q2040274) (← links)
• Best match graphs with binary trees (Q2062000) (← links)
• Compatibility of partitions with trees, hierarchies, and split systems (Q2127632) (← links)
• Reconstructing phylogenetic trees from multipartite quartet systems (Q2149097) (← links)
• Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees (Q2192103) (← links)
• Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees (Q2322864) (← links)
• Closure operations in phylogenetics (Q2382399) (← links)
• Best match graphs (Q2420450) (← links)
• Maximum agreement and compatible supertrees (Q2466022) (← links)
• Recovering a phylogenetic tree using pairwise closure operations (Q2484621) (← links)
• Identifying phylogenetic trees (Q2570101) (← links)
• Complete characterization of incorrect orthology assignments in best match graphs (Q2659043) (← links)
• Quasi-best match graphs (Q2691571) (← links)
• A navigation system for tree space (Q2800964) (← links)
• THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING <i>C</i>-RELATION (Q2976332) (← links)
• (Q3113567) (← links)