def maxProduct(self, words):
        l = map(len, words)
        codes = map(self.encode, words)
        maxa = 0
        for i in xrange(len(codes)):
            for j in xrange(i+1, len(codes)):
                if codes[i] & codes[j] == 0:
                    maxa = max(maxa, l[i]*l[j])

        return maxa
lookup peptide sequences with panther.
dataset/ETHPy150Open algorhythms/LeetCode/318 Maximum Product of Word Lengths.py/Solution.maxProduct--crossover with--dataset/ETHPy150Open CGATOxford/cgat/obsolete/pipeline_snps.py/preparePanther