Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SPRSupertrees / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3111159905 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2004.02298 / 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: Extremal distances for subtree transfer operations in binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / 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: Compatibility of unrooted phylogenetic trees is FPT / 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: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum parsimony distance between phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of display graphs: bounds, brambles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing MP distance between binary phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction rules for the maximum parsimony distance on phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reduction rules for the tree bisection and reconnection distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on convex characters, Fibonacci numbers and exponential-time algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth distance on phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phylogenetic incongruence through the lens of Monadic Second Order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Steiner trees: structural results and an exact solution approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex recolorings of strings and trees: Definitions, hardness results and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parsimony-based metric for phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybridization Number on Three Rooted Binary Trees is EPT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Phylogenetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Algorithms for Maximum Agreement Forests / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:22, 24 July 2024

scientific article
Language Label Description Also known as
English
Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm
scientific article

    Statements

    Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (English)
    0 references
    0 references
    2 February 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    phylogenetics
    0 references
    maximum parsimony
    0 references
    fixed-parameter tractability
    0 references
    maximum agreement forest
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references