The matroid structure of representative triple sets and triple-closure computation
From MaRDI portal
Publication:1746594
DOI10.1016/j.ejc.2018.02.013zbMath1384.05066arXiv1707.01667OpenAlexW2726984384MaRDI QIDQ1746594
Marc Hellmuth, Carsten R. Seemann
Publication date: 25 April 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.01667
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees ⋮ Phylogenetic flexibility via Hall-type inequalities and submodularity ⋮ Reconstructing gene trees from Fitch's xenology relation ⋮ Best match graphs with binary trees ⋮ Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Building species trees from larger parts of phylogenomic databases
- New results on optimizing rooted triplets consistency
- Phylogenetic diversity and the maximum coverage problem
- Rooted maximum agreement supertrees
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- The complexity of reconstructing trees from qualitative characters and subtrees
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
- A phase transition for a random cluster model on phylogenetic trees.
- Correction of weighted orthology and paralogy relations -- complexity and algorithmic results
- Subdominant matroid ultrametrics
- Reconstructing gene trees from Fitch's xenology relation
- Reconstructing minimal rooted trees.
- A characterisation of rigid circuit graphs
- Extension operations on sets of leaf-labelled trees
- Orthology relations, symbolic ultrametrics, and cographs
- A few logs suffice to build (almost) all trees. II
- Optimizing phylogenetic diversity under constraints
- Closure operations in phylogenetics
- On the hardness of inferring phylogenies from triplet-dissimilarities
- Recovering a phylogenetic tree using pairwise closure operations
- The Bergman complex of a matroid and phylogenetic trees
- Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets
- Phylogeny
- Basic Phylogenetic Combinatorics
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- A few logs suffice to build (almost) all trees (I)
- Algorithmic Aspects of Tree Amalgamation
- Determining the Evolutionary Tree Using Experiments
- A matroid associated with a phylogenetic tree
- Orthology Relation and Gene Tree Correction: Complexity Results
- Fast Compatibility Testing for Rooted Phylogenetic Trees
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Efficient algorithms for inferring evolutionary trees
- Combinatorial optimization. Theory and algorithms.
