Automorphism group algorithm in computer-aided structure elucidation


Autoria(s): Hao JF; Lu X
Data(s)

2000

Resumo

It is necessary to generate automorphism group of chemical graph in computer-aided structure eluciation. In this paper, an algorithm is developed by all-path topological symmetry algorithm to build automorphism group of chemical graph. A comparison of several topological symmetry algorithm reveals that all-path algorthm can yield correct of class of chemical graph. It lays a foundation for ESESOC system for computer-aided structure elucidation.

Identificador

http://202.98.16.49/handle/322003/19495

http://www.irgrid.ac.cn/handle/1471x/154482

Idioma(s)

中文

Fonte

Hao JF;Lu X.Automorphism group algorithm in computer-aided structure elucidation,CHINESE JOURNAL OF ANALYTICAL CHEMISTRY,2000,28(10):1209-1213

Palavras-Chave #CONNECTIVITIES HOC PROCEDURES #CHEMICAL STRUCTURES #UNIQUE DESCRIPTION #PERCEPTION
Tipo

期刊论文