Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727)

From MaRDI portal
Revision as of 22:43, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
scientific article

    Statements

    Convex recolorings of strings and trees: Definitions, hardness results and algorithms (English)
    0 references
    0 references
    0 references
    26 June 2008
    0 references
    algorithms
    0 references
    complexity
    0 references
    phylogenetics
    0 references
    dynamic programming
    0 references
    fixed parameter tractability
    0 references

    Identifiers

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