Patent ID: 7734421
Filing Date: 2010-06-08
Classification: A61P,G16B,Y02A

Abstract:
1. A method for identifying a motif or a combination of motifs having a Boolean state of predetermined mutations in a set of sequences comprising: a) aligning a set of sequences of ordered motifs represented by a single-character code on a programmed computer using a multiple sequence alignment program, b) comparing a reference sequence with the set of sequences aligned in step (a) by forming a first numerical matrix A of dimensions N×M in which N designates a number of sequences and M designates a number of motifs of one sequence of said alignment, with value A forming two analysis matrices B and C of mutations in which: determining for a set E of positions a coefficient R determining for a set F of positions, a coefficient R wherein in the matrices, i and k designate positions and j designates a sequence, and c) identifying motifs not having mutated simultaneously or motifs having mutated simultaneously at least once on at least one sequence of the set and not having mutated on another sequence of said set.