Journal
JOURNAL OF COMPUTATIONAL CHEMISTRY
Volume 33, Issue 19, Pages 1637-1642Publisher
WILEY-BLACKWELL
DOI: 10.1002/jcc.22995
Keywords
symmetry; symmetry element; point group; group theory; algorithm
Categories
Funding
- National Science Foundation [CHE-0520704, CHE-1039925, CHE-0624602]
- Division Of Chemistry
- Direct For Mathematical & Physical Scien [1039925] Funding Source: National Science Foundation
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available