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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2016.11.001 / rank
Normal rank
 
Property / author
 
Property / author: Andreas Dwi Maryanto Gunawan / rank
 
Normal rank
Property / author
 
Property / author: Bhaskar Das Gupta / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2016.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2548296792 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.IC.2016.11.001 / rank
 
Normal rank

Latest revision as of 02:17, 10 December 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