The Signature Molecular Descriptor. 4. Canonizing Molecules Using Extended Valence Sequences
- 10 January 2004
- journal article
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Computer Sciences
- Vol. 44 (2) , 427-436
Abstract
We present a new algorithm to canonize molecular graphs using the signature molecular descriptor introduced in the previous papers of this series. While developed specifically for molecular structures, the algorithm can be used for any graph and is not limited to acyclic graphs, planar graphs, bounded valence, or bounded genus graphs, for which polynomial time algorithms exist. The algorithm is tested with benzenoid hydrocarbons and a database of 126 705 organic compounds. The algorithm's performances are compared against Brendan Mc Kay's Nauty algorithm, which is believed to be the fastest graph canonization algorithm for general graphs, with five series of graphs each comprising up to 30 000 vertices: 2D meshes (pericondensed benzenoids), 3D cages (fullerenes and nanotubes), 3D meshes (crystal lattices), 4D cages, and power law graphs (protein and gene networks). The algorithm can be downloaded as an open source code at http://www.cs.sandia.gov/∼jfaulon/QSAR.Keywords
This publication has 7 references indexed in Scilit:
- The Signature Molecular Descriptor. 2. Enumerating Molecules from Their Extended Valence SequencesJournal of Chemical Information and Computer Sciences, 2003
- CAN WE EXPLOIT HYDROGENASES?2002
- Specificity and Stability in Topology of Protein NetworksScience, 2002
- Exploring the Limits of Graph Invariant- and Spectrum-Based Discrimination of (Sub)structuresJournal of Chemical Information and Computer Sciences, 2002
- The large-scale organization of metabolic networksNature, 2000
- CRC Handbook of Combinatorial Designs1996
- Highly discriminating distance-based topological indexChemical Physics Letters, 1982