Language for networks

• US 7,089,168 B2
• Filed: 11/04/2002
• Issued: 08/08/2006
• Est. Priority Date: 11/02/2001
• Status: Active Grant

• Current Assignee: Gene Network Sciences, Inc
• Original Assignee: Gene Network Sciences, Inc
• Inventors: Maimon, Ron
• Primary Examiner(s): PALADINI, ALBERT WILLIAM
• Application Number:
  US10/288,570
• Publication Number:
  US 20030115032A1
• Time in Patent Office: 1,373 Days
• Field of Search: 703/11, 703/22, 719/328, 715/363, 717/105
• US Class Current: 703/11
• CPC Class Codes: G06F 40/205 Parsing
• CPC Class Codes: G06F 40/211 Syntactic parsing, e.g. based on context-free grammar [CFG] or unification grammars

Abstract

Presently described is a formal language for describing the function of biochemical networks. Because it is a language, it includes a method of parsing, or understanding the language, which is a highly complex recursive algorithm. This formal language, the Cell Language, is described both informally, so that it may be written, and formally, so that it may be parsed. The Cell Language makes it possible to model all the interactions in a cell in a single diagram, with only a few representations of each molecule. The notation is compact and modular, in the sense that complex interactions composed of many subparts may be annotated with the same symbols as the simplest interactions composed of individual molecules or genes.

Claims

1. A method of modeling a system using a diagrammatic language, comprising:

describing said system using said diagrammatic language to form a diagram; and

parsing said diagram to form a model of said system, said parsing comprising historical resolution of state;

wherein said language comprises recursively nestable likeboxes, recursively nestable linkboxes, and implicit likeboxes.

2. A computer system for use in modeling a system with a diagrammatic language, comprising computer instructions for:

describing said system using said diagrammatic language to form a diagram; and

parsing said diagram to form a model of said system, said parsing comprising historical resolution of state;

wherein said language comprises recursively nestable likeboxes, recursively nestable linkboxes, and implicit likeboxes.

3. A computer-readable medium storing a computer program for use in modeling a system with a diagrammatic language, said program executable by a plurality of server computers, said program comprising computer instructions for:

describing said system using said diagrammatic language to form a diagram; and

parsing said diagram to form a model of said system, said parsing comprising historical resolution of state;

wherein said language comprises recursively nestable likeboxes, recursively nestable linkboxes, and implicit likeboxes.

4. A computer data signal embodied in a carrier wave for use in modeling a system with a diagrammatic language, comprising computer instructions for:

describing said system using said diagrammatic language to form a diagram; and

parsing said diagram to form a model of said system, said parsing comprising historical resolution of state;

wherein said language comprises recursively nestable likeboxes, recursively nestable linkboxes, and implicit likeboxes.

5. A method of producing a model using a diagrammatic language, parsed by an algorithm, comprising:

describing said system using a diagram drawing,

identifying an abstract diagram structure in said diagram drawing, and

applying a parsing algorithm to said abstract diagram structure to produce said model.

6. A method of converting a plurality of text strings representative of historical resolutions into information representative of the current state of at least one noun comprising:

concatenating the history of nouns that input to a verb into the history of the nouns that the verb creates.

7. A method of classifying states of an object comprising:

identifying unique objects and the transformations among them to classify the states of said object using the method of implicit likeboxes.

8. The method according to claim 7, wherein using the method of implicit likeboxes comprises:

identifying the equivalence class of unique nouns under the transitive closure of the associative relation of being on opposite sides of a verb.