These operators define schema-hierarchy graphs which can be used to aid in the synthesis of new programs.
Taking pathways into account leads to the following graph hierarchy : the graph G representing the whole network and n p induced subgraphs G i representing its n p metabolic pathways.
Algorithms are presented for efficiently obtaining least generalizations of schemata, for adding new schemata to a schema-hierarchy graph, and for using schemata to construct new programs.
How the hierarchy of graphs should be combined is also of interest.
To explain this phenomenon we need the hierarchy, so graphs are analyzed in the hierarchical manner.
Two elementary mutation operators, insertion and omission, are exemplarily applied to a hierarchy of graph-based models of increasing expressive power including directed graphs, event sequence graphs, finite-state machines and statecharts.
Variance structure is often exposed by an incremental process of decomposition or factoring, yielding a hierarchy or graph of components that together form an overall model.
CDEs can be created for any kind of concept, measurement, or application, and, although grouped into "Data Element Concepts" for convenience, need not derive their meaning from their position in a complex hierarchy or graph.
This can be done in several ways, ranging from very stringent approaches to very relaxed ones; from the most to the least stringent approach, one counts the hierarchy of elements (graph-cluster contrast), parts of the hierarchy (relaxed-graph-cluster contrast), only the elements devoid of hierarchy (set-cluster contrast) and parts of the elements (relaxed-set-cluster contrast).
The graph G i is said to be on the level i of the graph hierarchy, or the level i of the progress of the multilevel algorithm.
The third step consists of a refinement for assignment of GO terms by keeping only those new terms that add more information (higher specificity) to the gene, i.e. we accept only those new GO terms that reside deeper (closer to a leaf node in the graph) or on a different path than the original annotations in the overall GO graph hierarchy.
