摘要 |
Identifying motifs, or combinations of motifs, that have a boolean state of predetermined mutations in a set of sequences, comprising: (i) aligning the set of sequences of ordered motifs, represented by a single-character code; and (ii) comparing a reference sequence with the alignment, is new. Identifying motifs, or combinations of motifs, that have a boolean state of predetermined mutations in a set of sequences, comprises: (i) aligning the set of sequences of ordered motifs, represented by a single-character code; and (ii) comparing a reference sequence with the alignment. Motifs are identified that are never mutated simultaneously, or are mutated simultaneously at least once in at least one sequence, but not mutated in the other sequences.
|