Results 1 
6 of
6
MOLecular Structure GENeration with MOLGEN, new features and future developments
 Fresenius J. Anal. Chem
, 1997
"... MOLGEN is a computer program system which is designed for generating molecular graphs fast, redundancy free and exhaustively. In the present paper we describe its basic features, new features of the current release MOLGEN 3.5, and future developments which provide considerable improvements and ex ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
MOLGEN is a computer program system which is designed for generating molecular graphs fast, redundancy free and exhaustively. In the present paper we describe its basic features, new features of the current release MOLGEN 3.5, and future developments which provide considerable improvements and extensions. 1 Introduction MOLGEN [17] is a generator for molecular graphs (=connectivity isomers or constitutional formulae) allowing to generate all isomers that correspond to a given molecular formula and (optional) further conditions like prescribed and forbidden substructures, ring sizes etc. The input consists of ffl the empirical formula, together with ffl an optional list of macroatoms, which means prescribed substructures that must not overlap, ffl an optional goodlist, that consists of prescribed substructures which may overlap, ffl an optional badlist, containing forbidden substructures, ffl an optional interval for the minimal and maximal size of rings, ffl an optional num...
Molecules in Silico: Potential versus Known Organic Compounds
 MATCH Commun. Math. Comput. Chem
"... Abstract. For molecular weights up to 150, all molecular graphs corresponding to possible organic compounds made of C,H,N,O were generated using the structure generator MOLGEN. The numbers obtained were compared to the numbers of molecular graphs corresponding to actually known compounds as retrieve ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract. For molecular weights up to 150, all molecular graphs corresponding to possible organic compounds made of C,H,N,O were generated using the structure generator MOLGEN. The numbers obtained were compared to the numbers of molecular graphs corresponding to actually known compounds as retrieved from the Beilstein file. The results suggest that the overwhelming majority of all organic compounds (even in this low molecular weight range) is unknown. Within the set of C6H6 isomers, a very crude and a highly sophisticated energy content calculation perform amazingly similar in predicting a particular structure’s existence as a known compound. 1.
Construction of Combinatorial Objects
, 1995
"... Isomorphism problems often can be solved by determining orbits of a group acting on the set of all objects to be classified. The paper centers around algorithms for this topic and shows how to base them on the same idea, the homomorphism principle. Especially it is shown that forming Sims chains, u ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Isomorphism problems often can be solved by determining orbits of a group acting on the set of all objects to be classified. The paper centers around algorithms for this topic and shows how to base them on the same idea, the homomorphism principle. Especially it is shown that forming Sims chains, using an algorithmic version of Burnside's table of marks, computing double coset representatives, and computing Sylow subgroups of automorphism groups can be explained in this way. The exposition is based on graph theoretic concepts to give an easy explanation of data structures for group actions.
Algorithms for Group Actions: Homomorphism Principle and Orderly Generation Applied to Graphs
 OF DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
, 1996
"... The generation of discrete structures up to isomorphism is interesting as well for theoretical as for practical purposes. Mathematicians want to look at and analyse structures and for example chemical industry uses mathematical generators of isomers for structure elucidation. The example chosen in t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
The generation of discrete structures up to isomorphism is interesting as well for theoretical as for practical purposes. Mathematicians want to look at and analyse structures and for example chemical industry uses mathematical generators of isomers for structure elucidation. The example chosen in this paper for explaining general generation methods is a relatively far reaching and fast graph generator which should serve as a basis for the next more powerful version of MOLGEN, our generator of chemical isomers.
Ranking MOLGEN Structure Proposals by 13 C NMR Chemical Shift Prediction with ANALYZE
, 2002
"... 86 Artificial neural networks are capable of predicting the 13 C chemical shifts of organic molecules nearly as fast as incremental methods while maintaining the accuracy of database methods. In this article, we apply a recently developed neural network (Meiler et. al., J. Chem. Inf. Comput. Sci. 20 ..."
Abstract
 Add to MetaCart
(Show Context)
86 Artificial neural networks are capable of predicting the 13 C chemical shifts of organic molecules nearly as fast as incremental methods while maintaining the accuracy of database methods. In this article, we apply a recently developed neural network (Meiler et. al., J. Chem. Inf. Comput. Sci. 2000, 40, 11691176), to the screening of large sets of molecules obtained by structure generators in the process of automated structure elucidation. Specifically, we apply the network to sets of structures generated by MOLGEN (Benecke et. al., Anal. Chim. Acta 1995, 314, 141147) for ten randomly selected molecules of less than 13 nonhydrogen atoms. The computed 13 C NMR spectra are compared to the experimental spectrum; in all cases, the computed spectrum belonging to the example molecule yields a significantly smaller deviation to the experimental data then all other predicted spectra. This result suggests that the approach is suitable for automated structure prediction for organic molecules with up to 12 nonhydrogen atoms.
Algebraic Combinatorics in Bayreuth
, 1995
"... I should like to give a brief introduction of our group, describe its main activities in the field of Algebraic Combinatorics, and illustrate them by a few typical examples. 1 ..."
Abstract
 Add to MetaCart
(Show Context)
I should like to give a brief introduction of our group, describe its main activities in the field of Algebraic Combinatorics, and illustrate them by a few typical examples. 1