The maximum scoring directed spanning tree can be found efficiently when the score of a tree depends only on edge-based factors (McDonald et al., 2005b).
within a gap-minding tree, consider any node n with a gap (i.e., n's projection forms two non-contiguous intervals Let p be the parent of n. 1.