New results on optimizing rooted triplets consistency (Q708349): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036921810 / 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: Hardness of fully dense problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic construction of sets for <i>k</i> -restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum agreement and compatible supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic solutions for three taxon ML trees with variable rates across sites / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of constructing evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets / 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: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rooted maximum agreement supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network / 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: A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the Evolutionary Tree Using Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of rooted trees from subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A supertree method for rooted trees / 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: Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the maximum consensus tree from rooted Triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 08:14, 3 July 2024

scientific article
Language Label Description Also known as
English
New results on optimizing rooted triplets consistency
scientific article

    Statements

    New results on optimizing rooted triplets consistency (English)
    0 references
    0 references
    0 references
    0 references
    11 October 2010
    0 references
    0 references
    phylogenetic tree
    0 references
    rooted triplet
    0 references
    supertree
    0 references
    approximation algorithm
    0 references
    pseudorandomness
    0 references
    hardness of approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references