Mercurial > repos > nick > duplex
diff consensus.py @ 4:af383638de66 draft
planemo upload commit 022984f323d3da44f70b3bf79c684cfd8dda3f61-dirty
author | nick |
---|---|
date | Mon, 23 Nov 2015 18:44:23 -0500 |
parents | |
children |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/consensus.py Mon Nov 23 18:44:23 2015 -0500 @@ -0,0 +1,84 @@ +import os +import ctypes + +script_dir = os.path.dirname(os.path.realpath(__file__)) +consensus = ctypes.cdll.LoadLibrary(os.path.join(script_dir, 'consensusc.so')) +consensus.get_consensus.restype = ctypes.c_char_p +consensus.get_consensus_duplex.restype = ctypes.c_char_p +consensus.build_consensus_duplex_simple.restype = ctypes.c_char_p + + +# N.B.: The quality scores must be aligned with their accompanying sequences. +def get_consensus(align, quals=[], cons_thres=-1.0, qual_thres=' ', gapped=False): + cons_thres_c = ctypes.c_double(cons_thres) + qual_thres_c = ctypes.c_char(qual_thres) + n_seqs = len(align) + if gapped: + gapped_c = 1 + else: + gapped_c = 0 + assert not quals or len(quals) == n_seqs, 'Different number of sequences and quals.' + seq_len = None + for seq in (align + quals): + if seq_len is None: + seq_len = len(seq) + else: + assert seq_len == len(seq), 'All sequences in the alignment must be the same length.' + align_c = (ctypes.c_char_p * n_seqs)() + for i, seq in enumerate(align): + align_c[i] = ctypes.c_char_p(seq) + quals_c = (ctypes.c_char_p * n_seqs)() + for i, qual in enumerate(quals): + quals_c[i] = ctypes.c_char_p(qual) + if not quals: + quals_c = 0 + return consensus.get_consensus(align_c, quals_c, n_seqs, seq_len, cons_thres_c, qual_thres_c, + gapped_c) + + +# N.B.: The quality scores must be aligned with their accompanying sequences. +def get_consensus_duplex(align1, align2, quals1=[], quals2=[], cons_thres=-1.0, qual_thres=' ', + method='iupac'): + assert method in ('iupac', 'freq') + cons_thres_c = ctypes.c_double(cons_thres) + qual_thres_c = ctypes.c_char(qual_thres) + n_seqs1 = len(align1) + n_seqs2 = len(align2) + assert (not quals1 and not quals2) or (quals1 and quals2) + assert not quals1 or len(quals1) == n_seqs1 + assert not quals2 or len(quals2) == n_seqs2 + seq_len = None + for seq in (align1 + align2 + quals1 + quals2): + if seq_len is None: + seq_len = len(seq) + else: + assert seq_len == len(seq), 'All sequences in the alignment must be the same length.' + align1_c = (ctypes.c_char_p * n_seqs1)() + for i, seq in enumerate(align1): + align1_c[i] = ctypes.c_char_p(seq) + align2_c = (ctypes.c_char_p * n_seqs1)() + for i, seq in enumerate(align2): + align2_c[i] = ctypes.c_char_p(seq) + quals1_c = (ctypes.c_char_p * n_seqs1)() + for i, seq in enumerate(quals1): + quals1_c[i] = ctypes.c_char_p(seq) + quals2_c = (ctypes.c_char_p * n_seqs1)() + for i, seq in enumerate(quals2): + quals2_c[i] = ctypes.c_char_p(seq) + if not quals1: + quals1_c = 0 + if not quals2: + quals2_c = 0 + return consensus.get_consensus_duplex(align1_c, align2_c, quals1_c, quals2_c, n_seqs1, n_seqs2, + seq_len, cons_thres_c, qual_thres_c, method) + + +def build_consensus_duplex_simple(cons1, cons2, gapped=False): + assert len(cons1) == len(cons2) + cons1_c = ctypes.c_char_p(cons1) + cons2_c = ctypes.c_char_p(cons2) + if gapped: + gapped_c = 1 + else: + gapped_c = 0 + return consensus.build_consensus_duplex_simple(cons1_c, cons2_c, gapped_c)