EMCSS: A new method for maximal common substructure search
文献类型：期刊论文
| 作者 | Wang, T. ; Zhou, J. J. |
| 刊名 | Journal of Chemical Information and Computer Sciences
 |
| 出版日期 | 1997 |
| 期号 | 5页码:828-834 |
| 关键词 | genetic algorithms identification isomorphism perception selection mcss |
| 其他题名 | J. Chem. Inf. Comput. Sci. |
| 中文摘要 | This paper describes a new method-EMCSS for Maximal Common Substructure (MCS) search, which uses a substructure searching algorithm: Xu's GMA algorithm converts the MCS search space into a much smaller space, the connection table space of query graph (Qc), and adopts a evolutionary strategy to search the optimum solution. The principle of the EMCSS method and its implementation are described in detail. Some highly complex examples, even a hyperstructure pair, are tested. The investigation demonstrates that the EMCSS method is robust and efficient. |
| 收录类别 | SCI |
| 原文出处 | |
| 语种 | 英语 |
| 公开日期 | 2013-11-15 |
| 版本 | 出版稿 |
| 源URL | [http://ir.ipe.ac.cn/handle/122111/5914]  |
| 专题 | 过程工程研究所_研究所（批量导入） |
| 推荐引用方式 GB/T 7714 | Wang, T.,Zhou, J. J.. EMCSS: A new method for maximal common substructure search[J]. Journal of Chemical Information and Computer Sciences,1997(5):828-834. |
| APA | Wang, T.,&Zhou, J. J..(1997).EMCSS: A new method for maximal common substructure search.Journal of Chemical Information and Computer Sciences(5),828-834. |
| MLA | Wang, T.,et al."EMCSS: A new method for maximal common substructure search".Journal of Chemical Information and Computer Sciences .5(1997):828-834. |
入库方式： OAI收割
来源：过程工程研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。