Is there an algorithm for finding the number of cyclic isomers a given compound might have?

I've found a general algorithm for all isomers: link, but I'm not sure how to apply it for cyclic isomers only.

  • $\begingroup$ Do you care only for structural isomers, or do you need spatial isomers too? I'm sure including the latter makes it a much harder problem. $\endgroup$ – Nicolau Saker Neto Jan 22 '14 at 23:38
  • $\begingroup$ Only structural isomers. $\endgroup$ – JonathanReez Jan 22 '14 at 23:39
  • $\begingroup$ I wouldn't be astonished if A. T. Balaban has published something on this. Apart from his great book on pyrylium salts, he has spent decades on the application of graph theory in chemistry. $\endgroup$ – Klaus-Dieter Warzecha Jan 23 '14 at 0:30
  • 2
    $\begingroup$ Wow, that code listed is awful. It really hurts my eyes! $\endgroup$ – Jori Apr 19 '15 at 12:40
  • $\begingroup$ Depending on the level of complexity, you may want to consider statistical approaches (treating isomers as populations) too. $\endgroup$ – charlesreid1 Jun 6 '15 at 1:37

If I remember correctly, several years ago I stumbled over the SMOG program addressing this question (description here). The software requestested sum formula and a selection of allowed structural elements, cyclic substructures were among them. Maybe the algorithms implemented are not the first ones to answer such a question, yet publications like this showcase continuing interest in this field, too.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.