Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Maximal Common Subgraphs

McGregor, J. and Willett, P. (1981) Use of a maximal common subgraph algorithm in the automatic identification of the ostensible bond changes occurring in chemical reactions../. Chem. Inf. Comput. Sci. 21, 137-140. [Pg.46]

Therefore, searching for some edge-weighted maximal common subgraph for the two complete graphs is equivalent to searching for a clique [58] in this... [Pg.115]

For convenience, in the subsequent sections of this chapter, the mathematical terms introduced above, such as graph, subgraph, and maximal common subgraph, are interchangeably used with the corresponding chemical terms, such as structure, substructure, and maximal common substructure. [Pg.484]

Levi G. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 1972 9 341-352. [Pg.512]

McGregor JJ. Backtrack search algorithms and the maximal common subgraph problem. Softw Prac Exp 1982 12 23-34. [Pg.512]

Wipke WT, Rogers D. Tree-structured maximal common subgraph searching. An example of parallel computation with a single sequential processor. Tetrahedron Comput Methodol 1989 2 177-202. [Pg.513]

Grindley HM, Artymiuk PJ, Rice DW, Willett P. Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. J Mol Biol 1993 229 707-721. [Pg.513]

H. M. Grindley, P. J. Artymiuk, D. W. Rice, and P. Willett, J. Mol. Biol., 229, 707 (1993). Identification of Tertiary Structure Resemblance in Proteins Using a Maximal Common Subgraph Isomorphism Algorithm. [Pg.246]

The first approach is based on the maximal common subgraph (MCS) algorithm of Levi and Barrow et where an MCS is defined as the largest subgraph that is... [Pg.137]

Levi, G. A Note on the Derivation of Maximal Common Subgraphs of Two Directed or Undirected Graphs . Calcolo 1972, 9, 341-352. [Pg.143]

McGregor, J.J. Backtrack Search Algorithms and the Maximal Common Subgraph Problem . Software Pract. Exper.1982,12, 23-24. [Pg.143]

Wipke, W. J., Rogers, D. Tree Structured Maximal Common Subgraph Searching. An Example of Parallel Computation with a Single Sequential Processor . In the press. [Pg.384]

Buttke H, Shearra- K (1998) A graph distance metric based on the maximal common subgraph. Pattern Recog Lett 19 228-259... [Pg.229]

Figure 4 Example of a Maximal Common Subgraph for the two molecules shown above. Figure 4 Example of a Maximal Common Subgraph for the two molecules shown above.
Structured Maximal Common Subgraph Searching. An Example of Parallel Computation with a Single Sequential Processor. [Pg.66]

See other pages where Maximal Common Subgraphs is mentioned: [Pg.84]    [Pg.85]    [Pg.85]    [Pg.86]    [Pg.86]    [Pg.99]    [Pg.99]    [Pg.130]    [Pg.137]    [Pg.484]    [Pg.484]    [Pg.500]    [Pg.470]    [Pg.471]    [Pg.473]    [Pg.137]    [Pg.379]    [Pg.199]    [Pg.24]    [Pg.228]    [Pg.6]    [Pg.6]    [Pg.24]    [Pg.43]    [Pg.64]    [Pg.11]   
See also in sourсe #XX -- [ Pg.307 , Pg.379 ]



SEARCH



Maxim

Maximal common subgraph

Maximal common subgraph detection

Maximal-common-subgraph-isomorphism

Maximizer

Subgraph

Subgraphs

Subgraphs Common

Subgraphs Maximal

© 2024 chempedia.info