The study on automorphism group of ESESOC
文献类型:期刊论文
作者 | Hao JF ; Xu L |
刊名 | computers & chemistry
![]() |
出版日期 | 2002 |
卷号 | 26期号:2页码:119-123 |
关键词 | CONNECTIVITIES HOC PROCEDURES CHEMICAL STRUCTURES UNIQUE DESCRIPTION ALGORITHMS PERCEPTION |
ISSN号 | 0097-8485 |
通讯作者 | xu l |
中文摘要 | it is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. in this paper, an algorithm was developed by the all-paths topological symmetry algorithm to build the automorphism group of a chemical graph. a comparison of several topological symmetry algorithms reveals that the all-paths algorithm (apa) could yield the correct class of a chemical graph. it lays a foundation for the esesoc system in computer-aided structure elucidation. |
收录类别 | SCI收录期刊论文 |
语种 | 英语 |
WOS记录号 | WOS:000172889500004 |
公开日期 | 2010-11-03 |
源URL | [http://202.98.16.49/handle/322003/18857] ![]() |
专题 | 长春应用化学研究所_长春应用化学研究所知识产出_期刊论文 |
推荐引用方式 GB/T 7714 | Hao JF,Xu L. The study on automorphism group of ESESOC[J]. computers & chemistry,2002,26(2):119-123. |
APA | Hao JF,&Xu L.(2002).The study on automorphism group of ESESOC.computers & chemistry,26(2),119-123. |
MLA | Hao JF,et al."The study on automorphism group of ESESOC".computers & chemistry 26.2(2002):119-123. |
入库方式: OAI收割
来源:长春应用化学研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。