Matching algorithm(sub-graph isomorphism over vertex-ordered graphs)

Given: Diag = ( Sd, Hd, Cd, Fd), Patt = (T, Hp, Cp, Fp)

T= I0-V1-I1-V2- ... - Ik-1 - Vk-Ik

Sp= V1,V2, …,Vk

Set up a correspondence between the sequence numbers of

Sd and Sp with the constraints:

(1) 1 ? Sp ? |Sd|

(2) Spj+1 = Spj + Ij + 1

Then
• Hp ? Hd subset H-bonds
• Cp ? Cd subset Chiralities
• Fp ?' Fd subbag Fixed_structures
• Sp ? Sd subsequence SSEs

Previous slide

Next slide

Back to first slide

View graphic version