On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): journals/algorithmica/IerselKSSB18, #quickstatements; #temporary_batch_1731543907597
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2517904087 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1609.00544 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59514355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree transfer operations and their induced metrics on evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the number of hybridisation events for a consistent evolutionary history / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter tractability of agreement-based phylogenetic distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the minimum number of hybridization events for a consistent evolutionary history / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reticulation-visible networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating maximum agreement forest on multiple binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / 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: Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Single-Layer Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelizations for the hybridization number problem on multiple nonbinary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic kernel for computing the hybridization number of multiple trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a tree in a phylogenetic network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Algorithms for Maximum Agreement Forests / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/algorithmica/IerselKSSB18 / rank
 
Normal rank

Latest revision as of 01:38, 14 November 2024

scientific article
Language Label Description Also known as
English
On unrooted and root-uncertain variants of several well-known phylogenetic network problems
scientific article

    Statements

    On unrooted and root-uncertain variants of several well-known phylogenetic network problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    binary trees
    0 references
    fixed parameter tractability
    0 references
    kernelization
    0 references
    APX-hardness
    0 references
    NP-completeness
    0 references
    phylogenetic networks
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers