def _solve_loci_deprecated(c, locilen_sorted, seen_seqs, filtered, maxseq, n_cluster):
first_run = <NUM_LIT:0><EOL>seen_seqs = list()<EOL>n_cluster += <NUM_LIT:1><EOL>logger.debug("<STR_LIT>" % n_cluster)<EOL>new_c = cluster(n_cluster)<EOL>for idl, lenl in locilen_sorted:<EOL><INDENT>locus_seqs = c.loci2seq[idl]<EOL>if first_run == <NUM_LIT:0>:<EOL><INDENT>seen_seqs = locus_seqs<EOL>first_run = <NUM_LIT:1><EOL>first_idl = idl<EOL><DEDENT>intersect = list(set(seen_seqs).intersection(locus_seqs))<EOL>common = <NUM_LIT:0><EOL>if intersect:<EOL><INDENT>common = len(intersect)*<NUM_LIT:1.0>/min(len(seen_seqs), len(locus_seqs))<EOL><DEDENT>logger.debug("<STR_LIT>" % (c.id, idl, lenl, maxseq, len(seen_seqs), len(intersect), common))<EOL>if common*<NUM_LIT:1.0> >= <NUM_LIT>:<EOL><INDENT>if lenl*<NUM_LIT:1.0> >= <NUM_LIT>*maxseq:<EOL><INDENT>c, new_c, seen_seqs = _merge_loci_in_cluster(c, new_c, idl, seen_seqs)<EOL><DEDENT>else:<EOL><INDENT>c, new_c, seen_seqs = _merge_with_first_loci(c, new_c, first_idl, idl, seen_seqs)<EOL><DEDENT><DEDENT>else:<EOL><INDENT>c = _remove_seqs_from_loci(c, idl, seen_seqs)<EOL><DEDENT><DEDENT>filtered[n_cluster] = new_c<EOL>return c, seen_seqs, filtered, n_cluster<EOL>
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