# US 2004/0083062 A1 · Method for the processing of several different data structures

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0083062 A1
- Document ID: US20040083062A1
- Status: Published application
- Kind: A1
- Application number: 10/332,521
- Filed: 2003-05-09
- Published: 2004-04-29
- Earliest claimed: 2000-07-07
- Inventors: Maria Athelogou
- Web page: https://patentgrep.com/patent/US20040083062A1

## CPC

- G06N 5/02: Knowledge representation; Symbolic representation
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

What is disclosed is a method for processing data structures of different structures and contents by means of networked semantic units, which method includes the steps of: the steps of: acquisition of data wherefrom the different data structures are derivable, wherein respective data structures are represented in respective networked networks of semantic structure units; and generating, analyzing, modifying, deleting and/or storing the semantic structure units and/or networking them based on the acquired data by using a knowledge base comprised of a network of semantic knowledge units. Herein in iterative steps semantic structure units and/or the networking thereof are classified and a specific processing may be activated thanks to this classification, which specific processing modifies a respective semantic structure unit and/or a particular partial network.

## Claims

### Claim 1

A method for processing data structures of different structures and contents by means of networked semantic units, which method includes the steps of:
[a] acquisition of data wherefrom the different data structures are derivable, wherein respective data structures are represented in respective networked networks of semantic structure units; and
[b] generating, analyzing, modifying, deleting and/or storing the semantic structure units and/or networking them based on the acquired data by using a knowledge base comprised of a network of semantic knowledge units, wherein
in iterative steps semantic structure units and/or the networking thereof are classified and a specific processing may be activated thanks to this classification, which specific processing modifies a respective semantic structure unit and/or a particular partial network.

### Claim 2 (depends on 1)

The method in accordance with claim 1, characterized in that each of the semantic networks of structure units includes a hierarchy with hierarchy levels of superordinate, subordinate and neighboring semantic structure units.

### Claim 3 (depends on 2)

The method in accordance with claim 2, characterized in that superordinate semantic structure units comprise subordinate structure units from different networks of semantic structure units.

### Claim 4 (depends on 2, 3)

The method in accordance with claim 2 or 3, characterized in that data is acquired in one or several arbitrary hierarchy levels.

### Claim 5

The method in accordance with any one of the preceding claims, characterized in that the networks of semantic structure units overlap each other.

### Claim 6

The method in accordance with any one of the preceding claims, characterized in that in step [b] a networking between networks of semantic structure units is changed.

### Claim 7

The method in accordance with any one of the preceding claims, characterized in that in step [b] a networking between the network of semantic knowledge units and the networks of semantic structure units is changed.

### Claim 8

The method in accordance with any one of the preceding claims, characterized in that the several different data structures are interrelated biological, biochemical, biomedical and/or genetic data structures.

### Claim 9 (depends on 8)

The method in accordance with claim 8, characterized in that the several different data structures are DNA data structures, RNA data structures and/or protein data structures that are each represented in a network of semantic structure units.

### Claim 10 (depends on 9)

The method in accordance with claim 9, characterized in that networks of semantic structure units for DNA-, RNA- and protein data structures have a hierarchical structure such that based on different hierarchy levels an organism or several organisms may be represented, wherein data may be input at least into a partial area of one or several hierarchy levels of one or several of the networks of semantic structure units, and with the aid of the classification, a functional analysis of semantic structure units is performed in dependence on input data, such that a respective function of semantic structure units and of their networkings is determined and/or changed by all networks and between all networks of semantic structure units, and as a result of the functional analysis, the knowledge base present in the network of semantic knowledge units possibly will be changed.

### Claim 11 (depends on 10)

The method in accordance with claim 10, characterized in that function analysis serves diagnostic purposes so as to determine causes of changes inside an organism or several organisms.

### Claim 12 (depends on 9, 10, 11)

The method in accordance with any one of claims 9 to 11, characterized in that the classification is carried out by comparing, allocating, feeding back and deriving the several different data structures in such a manner that
respective networks of semantic structure units of the several different data structures are classified by means of the network of semantic knowledge units themselves and in dependence on this classification relationships and networkings within the respective networks of semantic structure units of the several different data structures are generated, and
the respective networks of semantic structure units of the several different data structures are classified with respect to each other by means of the network of semantic knowledge units, and relationships and networkings between the respective networks of semantic structure units of the several different data structures are generated in dependence on this classification.

### Claim 13 (depends on 12)

The method in accordance with claim 12, characterized in that networking between the respective ones of the networks of semantic structure units of the several different data structures takes place with the aid of a classification of information flows from a network of semantic structure units of the DNA data structures to a network of semantic structure units of the RNA data structures to a network of semantic structure units of the protein data structures and similar regressive processes.

### Claim 14 (depends on 8, 9, 10, 11, 12, 13)

The method in accordance with any one of claims 8 to 13, characterized in that semantic structure units are structure objects, linking objects linking semantic structure units, or networks/partial networks of semantic structure units.

### Claim 15 (depends on 14)

The method in accordance with claim 14, characterized in that the semantic structure objects are present in a super-structure object hierarchy, sub-structure object hierarchy and neighbor-structure object hierarchy in the networks of semantic structure units, with respective linking objects defining respective relationships between respective structure objects.

### Claim 16 (depends on 15)

The method in accordance with claim 15, characterized in that the relationships include neighborhood relationships, similarity relationships, relationships with super-structure objects, and relationships with sub-structure objects.

### Claim 17 (depends on 9, 10, 11, 12, 13, 14, 15, 16)

The method in accordance with any one of claims 9 to 16, characterized in that DNA sequences in a network of semantic structure units of DNA data structures are classified in that nucleotide structure units are grouped in sequences of three into newly formed codogen structure units and relationships between semantic structure units are formed, wherein the relationships include neighborhood relationships, similarity relationships, relationships with super-structure objects and relationships with sub-structure objects.

### Claim 18 (depends on 9, 10, 11, 12, 13, 14, 15, 16, 17)

The method in accordance with any one of claims 9 to 17, characterized in that RNA sequences are classified in a network of semantic structure units of RNA data structures in that nucleotide structure units are grouped in sequences of three into newly formed codon structure units and relationships between semantic structure units are formed, wherein the relationships include neighborhood relationships, similarity relationships, relationships with super-structure objects and relationships with sub-structure objects.

### Claim 19 (depends on 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)

The method in accordance with any one of claims 9 to 18, characterized in that relationships between DNA sequences in a network of semantic structure units of DNA data structures and RNA sequences in a network of semantic structure units of RNA data structures are formed by semantic structure units describing an allocation of semantic DNA structure units to semantic RNA structure units.

### Claim 20 (depends on 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19)

The method in accordance with any one of claims 9 to 19, characterized in that a classification of semantic structure units describing amino acids is carried out in a network of semantic structure units of protein data structures in such a manner that the semantic structure units describing amino acids are grouped, semantic structure units for the formed amino acid groups are formed, and relationships between the semantic structure units are formed, wherein the relationships include neighborhood relationships between the semantic structure units describing amino acids and similarity relationships between the semantic structure units describing amino acids, and wherein semantic structure units are generated and defined which describe relationships with semantic enzyme structure units, and semantic structure units are generated which describe relationships with super-structure objects.

### Claim 21 (depends on 20)

The method in accordance with claim 20, characterized in that the super-structure objects are semantic protein structure units.

### Claim 22 (depends on 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21)

The method in accordance with any one of claims 9 to 21, characterized in that local processes are classified as semantic units describing processes of a transformation of biological information.

### Claim 23 (depends on 22)

The method in accordance with claim 22, characterized in that the local processes are described by:
copying a DNA structure unit to an RNA structure unit;
fusing semantic structure units for nucleotide triplets into semantic structure units for an operon;
separating semantic units for nucleotide triplet groups into single semantic structure units for a nucleotide triplet;
regrouping semantic structure units for nucleotide triplets of a semantic structure unit for an operon into another semantic structure unit for an operon;
deleting semantic structure units for nucleotide triplets within a semantic structure unit for an operon; and
allocating semantic structure units for nucleotide triplets to semantic structure units for an operon.

### Claim 24 (depends on 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23)

The method in accordance with any one of claims 9 to 23, characterized in that local processes are classified as semantic units describing processes of a transformation of biochemical and genetic information.

### Claim 25 (depends on 24)

The method in accordance with claim 24, characterized in that the local processes are described by:
allocating semantic structure units for amino acids to a semantic structure unit for an m-RNA;
fusing semantic structure units for amino acids into higher semantic structure units within a protein and generating its allocation to semantic structure units for metabolic processes;
separating semantic structure units for amino acid groups into single semantic structure units for an amino acid;
regrouping semantic structure units for amino acids or amino acid groups;
deleting semantic structure units for amino acids within a partial network describing a semantic structure unit for a protein;
allocating semantic structure units for amino acids to the semantic structure units for proteins; and
forming semantic linking objects between the semantic structure units for amino acids, the semantic structure units for amino acid groups, and the semantic structure units for proteins.

### Claim 26 (depends on 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25)

The method in accordance with any one of claims 9 to 25, characterized in that semantic linking objects are formed which describe an allocation of a semantic structure unit for a t-RNA to different amino acids in protein formation.

### Claim 27 (depends on 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26)

The method in accordance with any one of claims 9 to 26, characterized in that semantic structure units are formed which describe local processes of copying, of searching, of prompting, of selecting, and of docking as semantic processing objects.

### Claim 28 (depends on 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27)

The method in accordance with any one of claims 9 to 27, characterized in that the following processes may be performed within a data structure:
fusing two or more codon structure units into a new super-structure unit, wherein at the same time the nucleotide structure units pertaining thereto are divided and new neighborhood relationships between these are generated;
fusing two or more codon or operon structure units into a larger structure unit by generating a new hierarchy level, wherein the corresponding codon or operon structure units form the sub-structure units of this new, larger structure unit;
incorporating two or more new structure units within a network of semantic structure units in such a way that upon generation of a new incorporation, a structure unit becomes a sub-structure unit of another structure unit;
separating a structure unit from its super-structure unit by generating a new kind of a neighborhood relationship with the former super-structure unit;
newly allocating a structure unit to a new sub-structure unit; and
regrouping a structure unit from one group of structure units to another group of structure units.

### Claim 29

The method in accordance with any one of the preceding claims, characterized in that a classification algorithm is started by string-matching, wherein knowledge units are characterized by particular strings and the classification algorithm recognizes fragments in the several different data structures having identical or similar strings, and generates classification connections with corresponding knowledge units of semantic structure units which correspond to these fragments, whereby in turn new algorithms may be called up.

### Claim 30 (depends on 29)

The method in accordance with claim 29, characterized in that classification is carried out with the aid of attributes.

### Claim 31 (depends on 30)

The method in accordance with claim 30, characterized in that the attributes include the strings code, content, length, variance, texture and position.

### Claim 32

The method in accordance with any one of the preceding claims, characterized in that classification is carried out with the aid of neighborhood relationships.

### Claim 33 (depends on 32)

The method in accordance with claim 32, characterized in that the neighborhood relationships include what neighbors, what relationship with the neighbors, what super-units, what sub-units and what relationships with the super-units and/or sub-units exist.

### Claim 34

The method in accordance with any one of the preceding claims, characterized in that semantic structure units are generated which are merely allocated a fictitious meaning in a classification by means of the network of semantic knowledge units.

### Claim 35 (depends on 34)

The method in accordance with claim 34, characterized in that the semantic structure units having merely been allocated a fictitious meaning are taken into consideration in another classification.
