A cubic-vertex kernel for flip consensus tree (Q2441594): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Kernels: Annotated, Proper and Induced / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for 3-leaf power graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phylogenetic supertrees. Combining information to reveal the tree of life / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness results for edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2k\) kernel for the cluster editing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lost Continent of Polynomial Time: Preprocessing and Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-based data clustering with overlaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parameterized Preprocessing for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-modeled data clustering: Exact algorithms for clique generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A More Relaxed Model for Graph-Based Data Clustering: <i>s</i>-Plex Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for inferring evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Edge Modification Problems without Polynomial Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classification of some edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method to speed up fixed-parameter-tractable algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete Directed Perfect Phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying modular decomposition to parameterized cluster editing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank

Latest revision as of 12:01, 7 July 2024

scientific article
Language Label Description Also known as
English
A cubic-vertex kernel for flip consensus tree
scientific article

    Statements

    A cubic-vertex kernel for flip consensus tree (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2014
    0 references
    computational phylogenetics
    0 references
    perfect phylogeny
    0 references
    NP-hard problem
    0 references
    edge-modification problem
    0 references
    fixed-parameter tractability
    0 references
    polynomial-time preprocessing
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references