Thanks Roger, Marcus. I am a newbie in this area and so it might be good for me to ask some potentially obvious questions about SMILES (since they are used everywhere).
1. Is the SMILES isomorphism problem equivalent to the graph isomorphism problem, or is there some advantage from being context free parsable? 2. In practice, do the edge cases that Roger mentioned effectively get added into the rewrite rules for the grammar or are they a separate kind of thing? 3. How is chirality handled?
.-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - . FRIAM Applied Complexity Group listserv Zoom Fridays 9:30a-12p Mtn UTC-6 bit.ly/virtualfriam un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ archives: 5/2017 thru present https://redfish.com/pipermail/friam_redfish.com/ 1/2003 thru 6/2021 http://friam.383.s1.nabble.com/
