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

Keyphrases

• Bounded Degree 33%
• Color Change 33%
• Color number 66%
• Convex Coloring 100%
• Convex Recoloring 100%
• Convexity 33%
• Hardness Results 100%
• Input Size 66%
• Knowledge-how 33%
• Minimal number 33%
• Negative numbers 33%
• Non-uniform Model 66%
• NP-hard 33%
• Partial Coloring 33%
• Phylogenetic Tree 33%
• PRESENT Algorithm 33%
• Recoloring 66%
• Total Coloring 33%
• Tree Definition 100%
• Uniform Model 33%
• Weighted Model 33%

Mathematics

• Fixed Number 100%
• Minimal Number 50%
• Natural Generalization 50%
• Natural Sense 50%
• Negative Number 50%
• Nonuniform 100%