Powered by OpenAIRE graph
Found an issue? Give us feedback
downloadFull-Text
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ DROPS - Dagstuhl Res...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics )
Article . 2008
License: CC BY NC ND
Full-Text: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1760
Data sources: Bielefeld Academic Search Engine (BASE)
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Algorithmica
Article
License: CC BY NC ND
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Dagstuhl Research Online Publication Server
Conference object . 2008
License: CC BY NC ND
Data sources: Dagstuhl Research Online Publication Server
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Algorithmica
Article . 2012 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2014
Data sources: zbMATH Open
https://dx.doi.org/10.1007/s00...
Article
Data sources: Microsoft Academic Graph
Université de Nantes: HAL-UNIV-NANTES
Article . 2014
Data sources: Bielefeld Academic Search Engine (BASE)
 View all 3 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

A Cubic-Vertex Kernel for Flip Consensus Tree

A cubic-vertex kernel for flip consensus tree
descriptionPublicationkeyboard_double_arrow_right Article , Conference object 26 Jun 2012 English Publisher:Springer Science and Business Media LLCJournal:Algorithmica, volume 68, pages 81-108 (issn: 0178-4617, eissn: 1432-0541, Copyright policy )
Authors: Komusiewicz, Christian; Uhlmann, Johannes;

doi: 10.1007/s00453-012-9663-1

A Cubic-Vertex Kernel for Flip Consensus Tree

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations
View all View all
Keywords

problem kernel, polynomial-time preprocessing, 004, Problems related to evolution, Fixed-parameter algorithm, Graph algorithms (graph-theoretic aspects), fixed-parameter tractability, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), perfect phylogeny, [INFO]Computer Science [cs], Analysis of algorithms, NP-hard problem, computational phylogenetics, graph modification problem, edge-modification problem, ddc: ddc:004

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 3
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
3
Average
Average
Average
Green
hybrid