Patent ID: 7558768

Claim:
A computer implemented method of identifying a motif in a graph representing a set of RNA or DNA data, said graph being a data structure stored on a computer-readable medium and having multiple vertices, the vertices having one or more attributes, the method comprising the steps of: for each vertex on the graph that has at least a defined one attribute, identifying a set of vertices, if any, adjacent to said each vertex and having at least one specified attribute; forming a first list comprised of said identified sets of vertices; determining unique intersections of the sets of said first list; saving said unique intersections in a database stored on a computer-readable medium; computing compact forms of the sets on said first list using a compact set notation in order to generate a compact location list; and identifying a motif of the graph to provide information about the set of RNA or DNA data, said motif being identified from said unique intersections and said compact location list utilizing one of compact-conglomerate notation and simultaneous breadth first search (BFS) algorithms, and said motif being stored in said database on a computer-readable medium; wherein said steps of computing compact forms and identifying a motif minimize combinatorial expressions associated with the set of vertices for each vertex.