Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcss.2007.10.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2007.10.003 / rank | |||
Normal rank | |||
Latest revision as of 08:38, 10 December 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
