In fact, both SMILES and SMARTS strings are first converted to internal graph representations which are searched for subgraph isomorphism.
Zapravo, SMILES i SMARTS niske se prvo konvertuju u internu graf reprezentaciju koja se pretražuje za podgraf izomorfizam.