Partial words are sequences over a finite alphabet that may have some undefined positions, or “holes,” that are denoted by ’s. A nonempty partial word is called bordered if one of its proper prefixes is compatible with one of its suffixes (here is compatible with every letter in the alphabet); it is called unbordered otherwise. In this paper, we investigate the problem of computing the maximum ...