The tree rectangle cover problem consists of a binary rooted tree T with n leaves, and a binary string s(v) of length m associated with each leaf v. The rectangle [w,(i, j)] spans positions i through j of s(v) for every node v in the subtree of T rooted at the node w (which can also be a leaf). A re...