Solving the tree containment problem in linear time for nearly stable phylogenetic networks (Q1647836): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q58172937, #quickstatements; #temporary_batch_1711626644914
 
Property / Wikidata QID
 
Property / Wikidata QID: Q58172937 / rank
 
Normal rank

Latest revision as of 14:06, 28 March 2024

scientific article
Language Label Description Also known as
English
Solving the tree containment problem in linear time for nearly stable phylogenetic networks
scientific article

    Statements

    Solving the tree containment problem in linear time for nearly stable phylogenetic networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 June 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    phylogenetic trees
    0 references
    phylogenetic networks
    0 references
    tree containment
    0 references
    reticulation visibility
    0 references
    nearly stable networks
    0 references
    genetically stable networks
    0 references
    0 references
    0 references