docs: def _solve_loci_deprecated(c, locilen_sorted, seen_seqs, filtered, maxseq, n_cluster):
      """internal function to reduce loci complexity
  
      The function will read the all loci in a cluster of
      sequences and will determine if all loci are part
      of the same transcriptional unit(TU) by most-vote locus
      or by exclusion of common sequence that are the
      minority of two loci.
  
      :param c: class cluster
      :param locilen_sorted: list of loci sorted by size
      :param seem_seqs: list of seen sequences
      :param filtered: final TU list
      :param maxseq: bigger locus
      "param n_cluster: integer with index of different TU"
      :return
       c: updated class cluster
       seen_seqs: updated list of sequences
       filtered: updated dict of TUs
       n_cluster: updated int with current index of TUs
      """
      first_run = 0
      seen_seqs = list()
      n_cluster += 1
      logger.debug("_solve_loci:new cluster %s" % n_cluster)
      new_c = cluster(n_cluster)
      for idl, lenl in locilen_sorted:
          locus_seqs = c.loci2seq[idl]
          if first_run == 0:
              seen_seqs = locus_seqs
              first_run = 1
              first_idl = idl
          intersect = list(set(seen_seqs).intersection(locus_seqs))
          common = 0
          if intersect:
              common = len(intersect)*1.0/min(len(seen_seqs), len(locus_seqs))
          logger.debug("_sole_loci:id %s idl %s len %s max %s seen %s inter %s common %s " % (c.id, idl, lenl, maxseq, len(seen_seqs), len(intersect), common))
          if common*1.0 >= 0.6:
              if lenl*1.0 >= 0.6*maxseq:
                  c, new_c, seen_seqs = _merge_loci_in_cluster(c, new_c, idl, seen_seqs)
              else:
                  c, new_c, seen_seqs = _merge_with_first_loci(c, new_c, first_idl, idl, seen_seqs)
          else:
              c = _remove_seqs_from_loci(c, idl, seen_seqs)
      filtered[n_cluster] = new_c
      return c, seen_seqs, filtered, n_cluster