A decomposition theorem and two algorithms for reticulation-visible networks (Q729819): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Lowest common ancestors in trees and directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reticulation-visible networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of viral evolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phylogenetic networks that display a tree twice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Algorithms for Finding Agreement Supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a Tree in a Phylogenetic Network in Quadratic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5169884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seeing the trees and their branches in the network is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for finding dominators in a flowgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Trees in a Phylogenetic Network Is \#P-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a tree in a phylogenetic network / rank
 
Normal rank

Revision as of 04:37, 13 July 2024

scientific article
Language Label Description Also known as
English
A decomposition theorem and two algorithms for reticulation-visible networks
scientific article

    Statements

    A decomposition theorem and two algorithms for reticulation-visible networks (English)
    0 references
    0 references
    0 references
    22 December 2016
    0 references
    phylogenetic networks
    0 references
    reticulation-visibility
    0 references
    tree containment problem
    0 references
    cluster containment problem
    0 references
    galled networks
    0 references

    Identifiers