code: def consecutive_exon_count(self1):
        
        best = 1
        consec = 1
        for i in range(0,len(self1.dif1)):
          if self1.dif1[i] == 1 and self1.dif2[i] == 1:
            consec += 1
          else: 
            consec = 1
          if consec > best:
            best = consec
        return best
docs: Best number of consecutive exons that overlap
  
        :return: matched consecutive exon count
        :rtype: int