4.4 Article

Symmetrizer: Algorithmic determination of point groups in nearly symmetric molecules

期刊

JOURNAL OF COMPUTATIONAL CHEMISTRY
卷 33, 期 19, 页码 1637-1642

出版社

WILEY-BLACKWELL
DOI: 10.1002/jcc.22995

关键词

symmetry; symmetry element; point group; group theory; algorithm

资金

  1. National Science Foundation [CHE-0520704, CHE-1039925, CHE-0624602]
  2. Division Of Chemistry
  3. Direct For Mathematical & Physical Scien [1039925] Funding Source: National Science Foundation

向作者/读者索取更多资源

Symmetry is an extremely useful and powerful tool in computational chemistry, both for predicting the properties of molecules and for simplifying calculations. Although methods for determining the point groups of perfectly symmetric molecules are well-known, finding the closest point group for a nearly symmetric molecule is far less studied, although it presents many useful applications. For this reason, we introduce Symmetrizer, an algorithm designed to determine a molecule's symmetry elements and closest matching point groups based on a user-adjustable tolerance, and then to symmetrize that molecule to a given point group geometry. In contrast to conventional methods, Symmetrizer takes a bottom-up approach to symmetry detection by locating all possible symmetry elements and uses this set to deduce the most probable point groups. We explain this approach in detail, and assess the flexibility, robustness, and efficiency of the algorithm with respect to various input parameters on several test molecules. We also demonstrate an application of Symmetrizer by interfacing it with the WebMO web-based interface to computational chemistry packages as a showcase of its ease of integration. (c) 2012 Wiley Periodicals, Inc.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据