In this paper we present algorithms for efficiently bitmasking strings. In particular, we assume a pattern (the bitmask) consisting of zeroes and ones as well as a text over an alphabet Sigma and the goal is to extract information efficiently when we apply the pattern on the text. Three algorithms are presented, each one based on different techniques, exhibiting various time complexities