Convex recolorings of strings and trees: Definitions, hardness results and algorithms☆
Under an Elsevier user license
open archive
Keywords
Algorithms
Complexity
Phylogenetics
Dynamic programming
Fixed parameter tractability
Cited by (0)
- ☆
A preliminary version of some of the results in this paper appeared in [S. Moran, S. Snir, Convex recoloring of strings and trees, Technical Report CS-2003-13, Technion, November 2003. [17]].
- 1
This research was supported by the Technion VPR-fund and by the Bernard Elkin Chair in Computer Science.
Copyright © 2008 Elsevier Inc. All rights reserved.