Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5293394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex recolorings of strings and trees: Definitions, hardness results and algorithms |
scientific article; zbMATH DE number 5293394 |
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
0.99494731426239
0 references
0.958506166934967
0 references
0.958052098751068
0 references
0.9106012582778932
0 references
0.9029115438461304
0 references
