Skip to content

Displaying common fingerprint bits as SMARTS in a sleeker way #22

Description

@PaulC61

Hi there,

So I've been using this snippet of code to visualize FP bits as smarts for quite a while now. It has been very useful!

https://github.com/greglandrum/rdkit_blog/blob/master/notebooks/Looking%20at%20Morgan%20bit%20counts.ipynb

Given the following smarts strings I can generate the attached plot:
['[OH;D1]-[c;R;D3]',
'C;D3(-[N;D3])=[O;D1]',
'NH;D2-C;D3=[O;D1]',
'CH2;R;D2-[CH2;R;D2]',
'CH2;R;D2-[CH2;R;D2]-[C;R;D4]',
'CH2;D2-N;D3-[CH2;D2]',
'c;R;D3(:[cH;R;D2]:[cH;R;D2]):[cH;R;D2]:[c;R;D3]',
'C@H;R;D3(-[CH2;R;D2])-[C;R;D4]',
'cH;R;D2:c;R;D3:[c;R;D3]',
'CH2;R;D2-[C;R;D4]']

Image

As you can see there is information lost between the SMARTS and the actual MolFromSmarts drawing. I know the original code was designed to visualise the smarts with molecule examples. However, I would like a sleek way of looking at the SMARTS strings themselves like in your recent blog posts (synthons) with attachments and bonding. If you already have some sort of converter, that would be great, if not, some pointers on where to start would be great. I'll get going myself - it seems fine

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions