Abstract

The Convex String Recoloring (CSR) problem measures the Hamming distance between a string of colored vertices to a convex string. This is a special case of the Convex Tree Recoloring (CTR) problem, which measures the Hamming distance to a perfect phylogeny, which was popularized by Moran and Snir. It has
... read more