Efficient approximation of convex recolorings (Q2643731): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2007.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111929782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: One for the price of two: a unified approach for approximating covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two strikes against perfect phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex tree realizations of partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for Near-Perfect Phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing phylogenetic number to find good evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for inferring evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring Evolutionary History From DNA Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non deterministic polynomial optimization problems and their approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Mutation Trees of Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank

Latest revision as of 13:17, 26 June 2024

scientific article
Language Label Description Also known as
English
Efficient approximation of convex recolorings
scientific article

    Statements

    Efficient approximation of convex recolorings (English)
    0 references
    0 references
    0 references
    27 August 2007
    0 references
    convex recoloring
    0 references
    approximation algorithms
    0 references
    phylogenetic trees
    0 references
    local ratio technique
    0 references

    Identifiers

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