Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:41, 30 January 2024
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
26 June 2008
0 references
algorithms
0 references
complexity
0 references
phylogenetics
0 references
dynamic programming
0 references
fixed parameter tractability
0 references
