code: def findPolymorphisms(self, strSeq, strict = False):
  		
  		arr = self.encode(strSeq)[0]
  		res = []
  		if not strict :
  			for i in range(len(arr)+len(self)) :
  				if i >= len(arr) or i > len(self) :
  					break
  				if arr[i] & self[i] == 0:
  					res.append(i)
  		else :
  			for i in range(len(arr)+len(self)) :
  				if i >= len(arr) or i > len(self) :
  					break
  				if arr[i] != self[i] :
  					res.append(i)
  		return res
docs: Compares strSeq with self.sequence.
  		If not 'strict', this function ignores the cases of matching heterozygocity (ex: for a given position i, strSeq[i] = A and self.sequence[i] = 'A/G'). If 'strict' it returns all positions where strSeq differs self,sequence