๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Unique description of chemical structures based on hierarchically ordered extended connectivities (HOC procedures). VIII. General principles for computer implementation

โœ Scribed by Nikolai Ralev; Stoyan Karabunarliev; Ovanes Mekenyan; Danail Bonchev; Alexandru T. Balaban


Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
327 KB
Volume
6
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

โœฆ Synopsis


The computer implementation of the HOC procedures presented in Parts I, I1 and I11 of this series is based on the module principle. It contains a main program and seventeen subroutines in Fortran IV. The system is able to provide unique atom numbering and code for all kinds of chemical compounds in their tremendous variety of structures.


๐Ÿ“œ SIMILAR VOLUMES


Unique description of chemical structure
โœ Ovanes Mekenyan; Danail Bonchev; Alexandru T. Balaban ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 945 KB

The basic notions and definitions, necessary for the better understanding of Part I of this series, are presented. The mathematical proof is given for sufficiency of the various HOC procedures for vertex canonical numbering and graph orbit finding.

Unique description of chemical structure
โœ Alexandru T. Balaban; Ovanes Mekenyan; Danail Bonchev ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 797 KB

A topological code is devised on the basis of the unique topological representation of the molecule described in the preceding two parts of this series.' By adding to the topological code additional chemical information on atoms and/or bonds, as well as stereochemical information, a chemical and res

Unique description of chemical structure
โœ Ovanes Mekenyan; Danail Bonchev; Alexandru T. Balaban ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 774 KB

The vertex numbering obtained by application of the HOC algorithm can be converted into two sequences of numbers: If each vertex starting with vertex 1 is only counted once, the sums of numberings of adjacent vertices form sequence S, ( i = 1-N), while the sums of S, values form sequence MI ( i = 1-