New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem (Q3503579): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reconstructing the shape of a tree from observed dissimilarity data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / 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 fixed-parameter algorithm for minimum quartet inconsistency / 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: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method to speed up fixed-parameter-tractable algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors / rank
 
Normal rank

Latest revision as of 11:23, 28 June 2024

scientific article
Language Label Description Also known as
English
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references