A cubic-vertex kernel for flip consensus tree
type: Item
instance of: scholarly article
title: A cubic-vertex kernel for flip consensus tree
zbMATH Open document ID: 1290.68047
author: Christian Komusiewicz
author: Johannes Uhlmann
published in: Algorithmica
publication date: 2014-03-25T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2008/1760/
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 6273583
zbMATH Keywords: computational phylogenetics
zbMATH Keywords: perfect phylogeny
zbMATH Keywords: NP-hard problem
zbMATH Keywords: edge-modification problem
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: polynomial-time preprocessing
MaRDI profile type: Publication
OpenAlex ID: W2082292526
cites work: Kernels: Annotated, Proper and Induced
cites work: Polynomial kernels for 3-leaf power graph modification problems
cites work: Phylogenetic supertrees. Combining information to reveal the tree of life
cites work: Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees
cites work: Kernelization: New Upper and Lower Bound Techniques
cites work: NP-completeness results for edge modification problems
cites work: A \(2k\) kernel for the cluster editing problem
cites work: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
cites work: Q4503944
cites work: The Lost Continent of Polynomial Time: Preprocessing and Kernelization
cites work: Graph-based data clustering with overlaps
cites work: Efficient Parameterized Preprocessing for Cluster Editing
cites work: Parametrized complexity theory.
cites work: Graph-modeled data clustering: Exact algorithms for clique generation
cites work: On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
cites work: Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
cites work: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
cites work: Efficient algorithms for inferring evolutionary trees
cites work: Two Edge Modification Problems without Polynomial Kernels
cites work: Q3128916
cites work: Complexity classification of some edge modification problems
cites work: Q5710169
cites work: A general method to speed up fixed-parameter-tractable algorithms
cites work: Incomplete Directed Perfect Phylogeny
cites work: Applying modular decomposition to parameterized cluster editing problems
cites work: Computing the Minimum Fill-In is NP-Complete
DOI: 10.1007/S00453-012-9663-1
description: scientific article