The matroid structure of representative triple sets and triple-closure computation (Q1746594): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2018.02.013 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdominant matroid ultrametrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bergman complex of a matroid and phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Tree Amalgamation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension operations on sets of leaf-labelled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on optimizing rooted triplets consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Compatibility Testing for Rooted Phylogenetic Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction of weighted orthology and paralogy relations -- complexity and algorithmic results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matroid associated with a phylogenetic tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Phylogenetic Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A few logs suffice to build (almost) all trees (I) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A few logs suffice to build (almost) all trees. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing gene trees from Fitch's xenology relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of inferring phylogenies from triplet-dissimilarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure operations in phylogenetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for inferring evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthology relations, symbolic ultrametrics, and cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering a phylogenetic tree using pairwise closure operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rooted maximum agreement supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring a level-1 phylogenetic network from a dense set of rooted triplets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the Evolutionary Tree Using Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthology Relation and Gene Tree Correction: Complexity Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A phase transition for a random cluster model on phylogenetic trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing phylogenetic diversity under constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phylogenetic diversity and the maximum coverage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building species trees from larger parts of phylogenomic databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing minimal rooted trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phylogeny / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2018.02.013 / rank
 
Normal rank

Latest revision as of 07:51, 11 December 2024

scientific article
Language Label Description Also known as
English
The matroid structure of representative triple sets and triple-closure computation
scientific article

    Statements

    The matroid structure of representative triple sets and triple-closure computation (English)
    0 references
    0 references
    0 references
    25 April 2018
    0 references
    minimal representative triple sets
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers