def _split_cluster_by_most_vote(c, p):
old, new = c[p[<NUM_LIT:0>]], c[p[<NUM_LIT:1>]]<EOL>old_size = _get_seqs(old)<EOL>new_size = _get_seqs(new)<EOL>logger.debug("<STR_LIT>" % (old.id, len(old_size), new.id, len(new_size)))<EOL>if len(old_size) > len(new_size):<EOL><INDENT>keep, remove = old, new<EOL><DEDENT>else:<EOL><INDENT>keep, remove = new, old<EOL><DEDENT>common = list(set(old_size).intersection(new_size))<EOL>logger.debug("<STR_LIT>" % (keep.id, remove.id, len(common)))<EOL>for idl in remove.loci2seq:<EOL><INDENT>if len(common) > <NUM_LIT:0>:<EOL><INDENT>remove.loci2seq[idl] = list(set(remove.loci2seq[idl]) - set(common))<EOL><DEDENT><DEDENT>keep.loci2seq = {k: v for k, v in keep.loci2seq.iteritems() if len(v) > <NUM_LIT:0>}<EOL>remove.loci2seq = {k: v for k, v in remove.loci2seq.iteritems() if len(v) > <NUM_LIT:0>}<EOL>keep.update()<EOL>remove.update()<EOL>c[keep.id] = keep<EOL>c[remove.id] = remove<EOL>return c<EOL>
split cluster by most-vote strategy