Extension operations on sets of leaf-labelled trees
From MaRDI portal
Publication:1914784
DOI10.1006/aama.1995.1020zbMath0863.92012OpenAlexW2009661773MaRDI QIDQ1914784
Publication date: 12 June 1997
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.1995.1020
quartetsphylogenetic treesrooted triplesgeneralized tree compatibility problemgraphical characterization of consistency and closurelabelled leavesoverlapping sets of taxa
Related Items (34)
Compatibility of unrooted phylogenetic trees is FPT ⋮ Some axiomatic limitations for consensus and supertree functions on hierarchies ⋮ Closure operations in phylogenetics ⋮ Reconstructing phylogenetic trees from multipartite quartet systems ⋮ Mathematical aspects of phylogenetic groves ⋮ Complete characterization of incorrect orthology assignments in best match graphs ⋮ \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time ⋮ Kernel and fast algorithm for dense triplet inconsistency ⋮ Best match graphs ⋮ An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees ⋮ Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees ⋮ Quasi-best match graphs ⋮ THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATION ⋮ A few logs suffice to build (almost) all trees. II ⋮ Tree representations of non-symmetric group-valued proximities ⋮ Groves of phylogenetic trees ⋮ Phylogenetic flexibility via Hall-type inequalities and submodularity ⋮ Maximum agreement and compatible supertrees ⋮ A characterization of dissimilarity families of trees ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ Inferring phylogenetic trees from the knowledge of rare evolutionary events ⋮ Building species trees from larger parts of phylogenomic databases ⋮ Corrigendum to: ``Best match graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quarnet inference rules for level-1 networks ⋮ Reconstructing gene trees from Fitch's xenology relation ⋮ Explosions and hot spots in supertree methods ⋮ Indirect identification of horizontal gene transfer ⋮ Reconstructing minimal rooted trees. ⋮ Best match graphs with binary trees ⋮ On the approximability of the maximum agreement subtree and maximum compatible tree problems ⋮ Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees ⋮ A supertree method for rooted trees
This page was built for publication: Extension operations on sets of leaf-labelled trees
