The gSpan Algorithm Based on Compound-Library Testing

Introduces a graph-based substructure pattern mining algorithm called gSpan,which discovers frequent substructures without candidate generation and adopts the depth-first search strategy to mine frequent connected subgraphs efficiently.Its performance is enhanced because the continuous design and non-candidate.When it is applied on the chemical compound-library Chemical-340,gSpan substantially outperforms previous algorithms such as FSG, sometimes by an order of magnitude.gSpan can be applied in the research of finding compounds with same substructure,it is very important to related areas.